Model elimination without contrapositives and its application to PTTP

We give modifications of model elimination that do not necessitate the use of contrapositives. These restart model elimination calculi are proven sound and complete, and their implementation by PTTP is depicted. The corresponding proof procedures are evaluated by a number of runtime experiments, and they are compared to other well-known provers. We relate our results to other calculi, namely, the connection method, modified problem reduction format, and near-Horn Prolog.

[1]  Dov M. Gabbay,et al.  N-Prolog: An Extension of Prolog with Hypothetical Implications I , 1984, J. Log. Program..

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

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

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

[5]  Wolfgang Bibel,et al.  Automated Theorem Proving , 1987, Artificial Intelligence / Künstliche Intelligenz.

[6]  David W. Reed,et al.  A Comparison of Three Prolog Extensions , 1992, J. Log. Program..

[7]  Peter Baumgartner,et al.  Consolution as a Framework for Comparing Calculi , 1993, J. Symb. Comput..

[8]  Mark E. Stickel,et al.  A Prolog Technology Theorem Prover: A New Exposition and Implementation in Prolog , 1990, Theor. Comput. Sci..

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

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

[11]  Jean H. Gallier,et al.  Logic for Computer Science: Foundations of Automatic Theorem Proving , 1985 .

[12]  Elmar Eder,et al.  Relative complexities of first order calculi , 1992, Artificial intelligence = Künstliche Intelligenz.

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

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

[15]  Elmar Eder.  Consolution and its Relation with Resolution , 1991, IJCAI.

[16]  David A. Plaisted,et al.  A sequent-style model elimination strategy and a positive refinement , 1990, Journal of Automated Reasoning.

[17]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[18]  David W. Reed,et al.  A Near-Horn Prolog for Compilation , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[19]  Peter Baumgartner,et al.  PROTEIN: A PROver with a Theory Extension INterface , 1994, CADE.

[20]  D.M. Gabbay,et al.  N-Prolog: An Extension of Prolog with Hypothetical Implication II - Logical Foundations, and Negation as Failure , 1985, J. Log. Program..

[21]  François Bry,et al.  SATCHMO: A Theorem Prover Implemented in Prolog , 1988, CADE.

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

[23]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[24]  José Júlio Alferes,et al.  SLWV - A Theorem Prover for Logic Programming , 1992, ELP.

[25]  Peter Baumgartner.  A Model Elimination Calculus with Built-in Theories , 1992, GWAI.

[26]  Donald W. Loveland,et al.  Near-Horn Prolog and beyond , 1991, Journal of Automated Reasoning.