Model Elimination and Connection Tableau Procedures

[1]  Martin Giese,et al.  Proof search without backtracking for free variable tableaux , 2002 .

[2]  Christoph Weidenbach,et al.  Combining Superposition, Sorts and Splitting , 2001, Handbook of Automated Reasoning.

[3]  Harald Ganzinger,et al.  Resolution Theorem Proving , 2001, Handbook of Automated Reasoning.

[4]  Reiner Hähnle,et al.  Tableaux and Related Methods , 2001, Handbook of Automated Reasoning.

[5]  Norbert Eisinger,et al.  A Confluent Connection Calculus , 2000, Intellectics and Computational Logic.

[6]  Reinhold Letz.  Using Matings for Pruning Connection Tableaux , 1998, CADE.

[7]  Harald Ganzinger,et al.  Elimination of Equality via Transformation with Ordering Constraints , 1998, CADE.

[8]  Peter Baumgartner,et al.  Hyper Tableau - The Next Generation , 1998, TABLEAUX.

[9]  John Harrison,et al.  Optimizing Proof Search in Model Elimination , 1996, CADE.

[10]  Jean-Paul Billon,et al.  The Disconnection Method - A Confluent Integration of Unification in the Analytic Framework , 1996, TABLEAUX.

[11]  Melvin Fitting,et al.  First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.

[12]  M. Fitting.  First-order logic and automated theorem proving (2nd ed.) , 1996 .

[13]  Uwe Petermann,et al.  Specifications of Inference Rules and Their Automatic Translation , 1995, TABLEAUX.

[14]  Christoph Goller,et al.  SETHEO V3.2: Recent Developments - System Abstract , 1994, CADE.

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

[16]  Reiner Hähnle,et al.  Semantic Tableaux with Ordering Restrictions , 1994, CADE.

[17]  Klaus Mayr,et al.  Refinements and Extensions of Model Elimination , 1993, LPAR.

[18]  M. Wallace,et al.  Two problems-two solutions: one system-ECLIPSE , 1993 .

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

[20]  Bernhard Beckert,et al.  An Improved Method for Adding Equality to Free Variable Semantic Tableaux , 1992, CADE.

[21]  Alexander Leitsch,et al.  Complexity of Resolution Proofs and Function Introduction , 1992, Ann. Pure Appl. Log..

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

[23]  Thierry Boy de la Tour.  Minimizing the Number of Clauses by Renaming , 1990, CADE.

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

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

[26]  Hans Benker,et al.  KCM: A Knowledge Crunching Machine , 1989, The 16th Annual International Symposium on Computer Architecture.

[27]  Hubert Comon-Lundh,et al.  Equational Problems and Disunification , 1989, J. Symb. Comput..

[28]  Graem A. Ringwood,et al.  Automated theorem proving (second revised edition) by Wolfgang Bibel, Vieweg 1987 , 1988, The Knowledge Engineering Review.

[29]  Constantin Halatsis,et al.  A New Abstract Prolog Instruction Set , 1987 .

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

[31]  David A. Plaisted,et al.  A Structure-Preserving Clause Form Translation , 1986, J. Symb. Comput..

[32]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[33]  Richard E. Korf,et al.  Iterative-Deepening-A*: An Optimal Admissible Tree Search , 1985, IJCAI.

[34]  Elmar Eder.  An Implementation of a Theorem Prover Based on the Connection Method , 1984, AIMSA.

[35]  Hiroshi Nakashima,et al.  Hardware Design and Implementation of the Personal Sequential Inference Machine (PSI) , 1984, Fifth Generation Computer Systems.

[36]  Michel Bidoit,et al.  A Rehabilitation of Robinson's Unification Algorithm , 1983, IFIP Congress.

[37]  Sloman,et al.  Automation of Reasoning , 1983, Symbolic Computation.

[38]  Peter B. Andrews.  Theorem Proving via General Matings , 1981, JACM.

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

[40]  Alfred V. Aho,et al.  Principles of Compiler Design (Addison-Wesley series in computer science and information processing) , 1977 .

[41]  Alfred V. Aho,et al.  Principles of Compiler Design , 1977 .

[42]  Robert E. Shostak.  Refutation Graphs , 1976, Artif. Intell..

[43]  Daniel Brand,et al.  Proving Theorems with the Modification Method , 1975, SIAM J. Comput..

[44]  Donald W. Loveland,et al.  A Unifying View of Some Linear Herbrand Procedures , 1972, J. ACM.

[45]  Robert A. Kowalski,et al.  Linear Resolution with Selection Function , 1971, Artif. Intell..

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

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

[48]  R. Smullyan.  First-Order Logic , 1968 .

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