MGTP: A model generation theorem prover — Its advanced features and applications —

Lecture Notes in Computer Science - Automated Reasoning with Analytic Tableaux and Related Methods ◽

10.1007/bfb0027401 ◽

1997 ◽

pp. 1-15 ◽

Cited By ~ 6

Author(s):

Ryuzo Hasegawa ◽

Hiroshi Fujita ◽

Miyuki Koshimura

Keyword(s):

Theorem Prover ◽

Model Generation ◽

Generation Theorem

Download Full-text

Answer Set Computation Based on a Minimal Model Generation Theorem Prover

PRICAI 2004: Trends in Artificial Intelligence - Lecture Notes in Computer Science ◽

10.1007/978-3-540-28633-2_7 ◽

2004 ◽

pp. 43-52 ◽

Cited By ~ 1

Author(s):

Yasuyuki Shirai ◽

Ryuzo Hasegawa

Keyword(s):

Minimal Model ◽

Theorem Prover ◽

Model Generation ◽

Generation Theorem ◽

Answer Set

Download Full-text

Embedding negation as failure into a model generation theorem prover

Automated Deduction—CADE-11 - Lecture Notes in Computer Science ◽

10.1007/3-540-55602-8_180 ◽

1992 ◽

pp. 400-415 ◽

Cited By ~ 29

Author(s):

Katsumi Inoue ◽

Miyuki Koshimura ◽

Ryuzo Hasegawa

Keyword(s):

Theorem Prover ◽

Model Generation ◽

Generation Theorem ◽

Negation As Failure

Download Full-text

An Improvement of Herbrand's Theorem and Its Application to Model Generation Theorem Proving

Journal of Computer Science and Technology ◽

10.1007/s11390-007-9062-2 ◽

2007 ◽

Vol 22 (4) ◽

pp. 541-553

Author(s):

Yu-Yan Chao ◽

Li-Feng He ◽

Tsuyoshi Nakamura ◽

Zheng-Hao Shi ◽

Kenji Suzuki ◽

...

Keyword(s):

Theorem Proving ◽

Model Generation ◽

Generation Theorem ◽

Herbrand’S Theorem ◽

Herbrand's Theorem ◽

Model Generation Theorem Proving

Download Full-text

MGTP: A parallel theorem prover based on lazy model generation

Automated Deduction—CADE-11 - Lecture Notes in Computer Science ◽

10.1007/3-540-55602-8_223 ◽

1992 ◽

pp. 776-780 ◽

Cited By ~ 4

Author(s):

Ryuzo Hasegawa ◽

Miyuki Koshimura ◽

Hiroshi Fujita

Keyword(s):

Theorem Prover ◽

Model Generation

Download Full-text

Model Generation Theorem Proving with Finite Interval Constraints

Computational Logic — CL 2000 - Lecture Notes in Computer Science ◽

10.1007/3-540-44957-4_19 ◽

2000 ◽

pp. 285-299 ◽

Cited By ~ 2

Author(s):

Reiner Hähnle ◽

Ryuzo Hasegawa ◽

Yasuyuki Shirai

Keyword(s):

Theorem Proving ◽

Finite Interval ◽

Model Generation ◽

Generation Theorem ◽

Interval Constraints ◽

Model Generation Theorem Proving

Download Full-text

A Model Generation Based Theorem Prover MGTP for First-Order Logic

Computational Logic: Logic Programming and Beyond - Lecture Notes in Computer Science ◽

10.1007/3-540-45632-5_8 ◽

2002 ◽

pp. 178-213 ◽

Cited By ~ 2

Author(s):

Ryuzo Hasegawa ◽

Hiroshi Fujita ◽

Miyuki Koshimura ◽

Yasuyuki Shirai

Keyword(s):

Order Logic ◽

Theorem Prover ◽

First Order Logic ◽

Model Generation ◽

First Order

Download Full-text

Model Generation Theorem Provers and Their Applications

Logic Programming ◽

10.7551/mitpress/4298.003.0009 ◽

1995 ◽

Keyword(s):

Model Generation ◽

Generation Theorem ◽

Theorem Provers

Download Full-text

Automated theorem-proving research in the Fifth Generation Computer Systems Project: Model generation theorem provers

Future Generation Computer Systems ◽

10.1016/0167-739x(93)90007-c ◽

1993 ◽

Vol 9 (2) ◽

pp. 143-152

Author(s):

Mark E Stickel

Keyword(s):

Theorem Proving ◽

Automated Theorem Proving ◽

Computer Systems ◽

Model Generation ◽

Generation Theorem ◽

Theorem Provers ◽

Fifth Generation ◽

Project Model ◽

Generation Computer

Download Full-text

Formal Verification of Helicopter Automatic Landing Control Algorithm in Theorem Prover Coq

10.23940/ijpe.18.09.p2.19471957 ◽

2018 ◽

Cited By ~ 1

Author(s):

Xi Chen

Keyword(s):

Formal Verification ◽

Control Algorithm ◽

Theorem Prover ◽

Automatic Landing ◽

Landing Control

Download Full-text

Evaluation Opportunities in Mechanized Theories

10.29007/7kx8 ◽

2018 ◽

Author(s):

Joe Hurd

Keyword(s):

Mathematical Theory ◽

Theorem Prover ◽

Mechanized Mathematics ◽

Reasoning Tasks

This invited talk will look at logic solvers through the application lens of constructing and processing a theory library of mechanized mathematics. In fact, constructing and processing theories are two distinct applications, and each will be considered in turn. Construction is carried out by formalizing a mathematical theory using an interactive theorem prover, and logic solvers can remove much of the drudgery by automating common reasoning tasks. At the theory library level, logic solvers can provide assistance with theory engineering tasks such as compressing theories, managing dependencies, and constructing new theories from reusable theory components.

Download Full-text