leanCoP: lean connection-based theorem proving

The Prolog program "prove (M,I) : - append (Q, [C|R], M), \+member (-_, C), append(Q,R,S), prove([!],[[-!|C] |S],[],I). prove ([],_,_,_). prove([L|C],M,P,I) :- (-N=L; -L=N) -> (member(N,P); append(Q,[D|R],M), copy_term(D,E), append(A,[N|B],E), append(A,B,F), (D==E -> append(R,Q,S); length(P,K), K<I, append(R,[D|Q],S)), prove(F,S,[L|P],I)), prove(C,M,P,I)." implements a theorem prover for classical first-order (clausal) logic which is based on the connection calculus. It is sound and complete (provided that an arbitrarily large I is iteratively given), and demonstrates a comparatively strong performance.

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

[2]  William McCune,et al.  OTTER 3.0 Reference Manual and Guide , 1994 .

[3]  Christoph Kreitz,et al.  Connection-based Theorem Proving in Classical and Non-classical Logics , 1999, J. Univers. Comput. Sci..

[4]  Christoph Kreitz,et al.  A Uniform Proof Procedure for Classical and Non-Classical Logics , 1996, KI.

[5]  Wolfgang Bibel,et al.  Deduction - automated logic , 1993 .

[6]  Geoff Sutcliffe,et al.  The TPTP Problem Library , 1994, Journal of Automated Reasoning.

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

[8]  Bernhard Beckert,et al.  leanTAP: Lean Tableau-Based Theorem Proving (Extended Abstract) , 1994, CADE.

[9]  Jens Otten,et al.  linTAP: A Tableau Prover for Linear Logic , 1999, TABLEAUX.

[10]  Jens Otten.  ileanTAP: An Intuitionistic Theorem Prover , 1997, TABLEAUX.

[11]  Bernhard Beckert.  Leant a P: Lean Tableau-based Theorem Proving , .

[12]  Mark E. Stickel.  A Prolog Technology Theorem Prover: A New Exposition and Implementation in Prolog , 1990, DISCO.

[13]  Bernhard Beckert,et al.  Free-Variable Tableaux for Propositional Modal Logics , 2001, Stud Logica.

[14]  G. Gentzen.  Untersuchungen über das logische Schließen. I , 1935 .

[15]  Joachim Steinbach,et al.  SETHEO and E-SETHEO - The CADE-13 Systems , 2004, Journal of Automated Reasoning.

[16]  Bernhard Beckert,et al.  leanTAP: Lean tableau-based deduction , 1995, Journal of Automated Reasoning.

[17]  Peter Baumgartner,et al.  Model Elimination Without Contrapositives , 1994, CADE.

[18]  Wolfgang Bibel.  Matings in matrices , 1983, CACM.

[19]  Gernot Stenz,et al.  E-SETHEO: An Automated3 Theorem Prover , 2000, TABLEAUX.

[20]  Owen L. Astrachan,et al.  METEORs: High Performance Theorem Provers Using Model Elimination , 1990, Automated Reasoning: Essays in Honor of Woody Bledsoe.

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

[22]  William F. Clocksin,et al.  Programming in Prolog , 1987, Springer Berlin Heidelberg.

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

[24]  Bernhard Beckert,et al.  Free Variable Tableaux for Propositional Modal Logics , 1997, TABLEAUX.

[25]  Christoph Goller,et al.  Controlled integration of the cut rule into connection tableau calculi , 2004, Journal of Automated Reasoning.

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

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

[28]  Christoph Kreitz,et al.  T-String Unification: Unifying Prefixes in Non-classical Proof Methods , 1996, TABLEAUX.

[29]  D. Gabbay,et al.  Handbook of tableau methods , 1999 .

[30]  Jens Otten,et al.  linTAP : A Tableau Prover for Linear Logi , 1999 .

[31]  Peter H. Schmitt,et al.  Implementing Semantic Tableaux , 1999 .