METEOR: Exploring model elimination theorem proving

In this paper we describe the theorem proverMETEOR which is a high-performance model elimination prover running in sequential, parallel, and distributed computing environments.METEOR has a very high inference rate. But, as is the case with better chess-playing programs, speed alone is not sufficient when exploring large search spaces; intelligent search is necessary. We describe modifications to traditional iterative deepening search mechanisms whose implementation inMETEOR result in performance improvements of several orders of magnitude and that have permitted the discovery of proofs unobtainable by top-down model elimination provers.

[1]  Owen L. Astrachan,et al.  Investigations in Model Elimination Based Theorem Proving , 1992 .

[2]  Soumitra Bose,et al.  PARTHENON: a parallel theorem prover for nonHorn clauses , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[3]  Mark E. Stickel,et al.  Caching and Lemmaizing in Model Elimination Theorem Provers , 1992, CADE.

[4]  William McCune.  Otter 2.0 , 1990, CADE.

[5]  W. Richard Stevens,et al.  Unix network programming , 1990, CCRV.

[6]  Mark E. Stickel,et al.  A Prolog Technology Theorem Prover , 1990, CADE.

[7]  Ross A. Overbeek,et al.  Exploitation of parallel processing for implementing high-performance deduction systems , 2004, Journal of Automated Reasoning.

[8]  Mark E. Stickel,et al.  A prolog technology theorem prover: Implementation by an extended prolog compiler , 1986, Journal of Automated Reasoning.

[9]  Donald W. Loveland,et al.  Automated theorem proving: a logical basis , 1978, Fundamental studies in computer science.

[10]  W. W. Bledsoe,et al.  Challenge problems in elementary calculus , 1990, Journal of Automated Reasoning.

[11]  Nachum Dershowitz,et al.  Completion Without Failure11This research was supported in part by the National Science Foundation under grants DCR 85–13417 and DCR 85–16243. , 1989 .

[12]  Jack Minker,et al.  Resolution, Refinements, and Search Strategies: A Comparative Study , 1976, IEEE Transactions on Computers.

[13]  Johann Schumann,et al.  PARTHEO: A High-Performance Parallel Theorem Prover , 1990, CADE.

[14]  Udi Manber,et al.  On maintaining dynamic information in a concurrent environment , 1984, STOC '84.

[15]  Mabry Tyson,et al.  An Analysis of Consecutively Bounded Depth-First Search with Applications in Automated Deduction , 1985, IJCAI.

[16]  Leslie Lamport,et al.  Concurrent reading and writing , 1977, Commun. ACM.

[17]  Larry Wos,et al.  Subsumption, a Sometimes Undervalued Procedure , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[18]  Donald W. Loveland,et al.  An Implementation of the Model Elimination Proof Procedure , 1974, JACM.

[19]  Nachum Dershowitz,et al.  Orderings for term-rewriting systems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[20]  Carla Schlatter Ellis,et al.  Evaluation of concurrent pools , 1989, [1989] Proceedings. The 9th International Conference on Distributed Computing Systems.

[21]  Carla Schlatter Ellis.  Concurrent search and insertion in 2–3 trees , 2004, Acta Informatica.

[22]  William McCune,et al.  ROO: A Parallel Theorem Prover , 1992, CADE.

[23]  Owen L. Astrachan.  METEORs: High Performance Theorem Provers Using Model Elimination , 1990, Dagstuhl Seminar on Parallelization in Inference Systems.

[24]  Nachum Dershowitz.  Orderings for Term-Rewriting Systems , 1979, FOCS.

[25]  Anthony Preston,et al.  Book review: Automated Reasoning: 33 Basic Research Problems by Larry Wos (Prentice Hall 1988) , 1988, SGAR.

[26]  Larry Wos,et al.  Automated reasoning - 33 basic research problems , 1988 .

[27]  W. W. Bledsoe,et al.  Hierarchical deduction , 1987, Journal of Automated Reasoning.

[28]  Maria Paola Bonacina,et al.  Distributed Deduction by Clause-Diffusion: The Aquarius Prover , 1993, DISCO.

[29]  David A. Plaisted,et al.  Non-Horn clause logic programming without contrapositives , 1988, Journal of Automated Reasoning.

[30]  Donald W. Loveland,et al.  A Simplified Format for the Model Elimination Theorem-Proving Procedure , 1969, J. ACM.

[31]  Donald W. Loveland,et al.  Mechanical Theorem-Proving by Model Elimination , 1968, JACM.

[32]  Rudolf Bayer,et al.  Concurrency of operations on B-trees , 1994, Acta Informatica.

[33]  Soumitra Bose,et al.  Parthenon: A parallel theorem prover for non-horn clauses , 1988, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[34]  Bruce Spencer.  Avoiding Duplicate Proofs , 1990, NACLP.

[35]  Wolfgang Bibel,et al.  SETHEO: A high-performance theorem prover , 1992, Journal of Automated Reasoning.

[36]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[37]  W LovelandDonald.  Mechanical Theorem-Proving by Model Elimination , 1968 .

[38]  Khayri A. M. Ali,et al.  The Muse Or-Parallel Prolog Model and its Performance , 1990, NACLP.