Automated Theorem Proving

I. Natural and formal logic.- II. The connection method in propositional logic.- III. The connection method in first-order logic.- IV. Variants and improvements.- V. Applications and extensions.- Mnemonics for use in references.- References.- List of Symbols.

[1]  B. Russell.  Mathematical Logic as Based on the Theory of Types , 1908 .

[2]  G. Gentzen.  Die Widerspruchsfreiheit der reinen Zahlentheorie , 1936 .

[3]  W. Ackermann,et al.  Grundzüge der theoretischen Logik , 1928 .

[4]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[5]  K. Schütte.  Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie , 1950 .

[6]  Willard Van Orman Quine,et al.  A Way to Simplify Truth Functions , 1955 .

[7]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[8]  R. Montague,et al.  Logic : Techniques of Formal Reasoning , 1964 .

[9]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[10]  Larry Wos,et al.  The Concept of Demodulation in Theorem Proving , 1967, JACM.

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

[12]  J. R. Guard,et al.  Semi-Automated Mathematics , 1969, JACM.

[13]  W. Bibel.  Schnittelimination in einem Teilsystem der einfachen Typenlogik , 1969 .

[14]  Dag Prawitz.  A proof procedure with matrix reduction , 1970 .

[15]  D. Loveland.  A Linear Format for Resolution , 1970 .

[16]  D. Luckham.  Refinement Theorems in Resolution Theory , 1970 .

[17]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[18]  George W. Ernst.  The Utility of Independent Subgoals in Theorem Proving , 1971, Inf. Control..

[19]  Jack Minker,et al.  Outline bibliography, and KWIC index on mechanical theorem proving and its applications , 1971 .

[20]  Zohar Manna,et al.  Towards automatic program synthesis , 1971, Symposium on Semantics of Algorithmic Languages.

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

[22]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[23]  G. V. Davydov.  Synthesis of the resolution method with the inverse method , 1972 .

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

[25]  Patrick J. Hayes,et al.  Computation and Deduction , 1973, MFCS.

[26]  Hans Hermes,et al.  Introduction to mathematical logic , 1973, Universitext.

[27]  S. Cook,et al.  On the lengths of proofs in the propositional calculus (Preliminary Version) , 1974, STOC '74.

[28]  Wolfgang Bibel.  Effizienzvergleiche von Beweisprozeduren , 1974, GI Jahrestagung.

[29]  Robert A. Kowalski,et al.  Predicate Logic as Programming Language , 1974, IFIP Congress.

[30]  Robert A. Kowalski,et al.  A Proof Procedure Using Connection Graphs , 1975, JACM.

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

[32]  M. V. Zilli.  Complexity of the unification algorithm for first-order expressions , 1975 .

[33]  Raymond Aubin,et al.  Mechanizing structural induction , 1976 .

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

[35]  Alberto Martelli,et al.  Unification in linear time and space: a structured presentation , 1976 .

[36]  Peter B. Andrews.  Refutations by Matings , 1976, IEEE Transactions on Computers.

[37]  Larry Wos,et al.  Problems and Experiments for and with Automated Theorem-Proving Programs , 1976, IEEE Transactions on Computers.

[38]  Tomasz Pietrzykowski,et al.  Mechanizing omega-Order Type Theory Through Unification , 1976, Theor. Comput. Sci..

[39]  Sharon Sickel,et al.  A Search Technique for Clause Interconnectivity Graphs , 1976, IEEE Transactions on Computers.

[40]  W. W. Bledsoe,et al.  Non-Resolution Theorem Proving , 1977, Artif. Intell..

[41]  Zvi Galil,et al.  On the Complexity of Regular Resolution and the Davis-Putnam Procedure , 1977, Theor. Comput. Sci..

[42]  Wolfgang Bibel.  A syntactic connection between proof procedures and refutation prcedures , 1977, Theoretical Computer Science.

[43]  W. W. Bledsoe,et al.  Automatic Proofs of Theorems in Analysis Using Nonstandard Techniques , 1977, JACM.

[44]  Jörg H. Siekmann,et al.  Completeness and Soundness of the Connection Graph Proof , 1978, AISB/GI.

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

[46]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[47]  Robert S. Boyer,et al.  A computational logic handbook , 1979, Perspectives in computing.

[48]  B. Dreben,et al.  The decision problem: Solvable classes of quantificational formulas , 1979 .

[49]  Stephen A. Cook,et al.  The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.

[50]  Harry R. Lewis,et al.  Unsolvable classes of quantificational formulas , 1979 .

[51]  Elliott Mendelson,et al.  Introduction to Mathematical Logic , 1979 .

[52]  Wolfgang Bibel.  Tautology Testing with a Generalized Matrix Reduction Method , 1979, Theor. Comput. Sci..

[53]  J. A. Robinson,et al.  Logic, form and function , 1979 .

[54]  Wolfgang Bibel,et al.  Syntax-Directed, Semantics-Supported Program Synthesis , 1979, Artif. Intell..

[55]  Wolfgang Bibel.  A Theoretical Basis for the Systematic Proof Method , 1980, MFCS.

[56]  Derek C. Oppen,et al.  Reasoning about recursively defined data structures , 1978, POPL.

[57]  Gérard P. Huet,et al.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[58]  Gérard P. Huet,et al.  Proofs by Induction in Equational Theories with Constructors , 1980, FOCS.

[59]  Mordechai Ben-Ari,et al.  A Simplified Proof That Regular Resolution is Exponential , 1980, Inf. Process. Lett..

[60]  G. Huet,et al.  Equations and rewrite rules: a survey , 1980 .

[61]  Richard W. Weyhrauch,et al.  Prolegomena to a Theory of Mechanized Formal Reasoning , 1980, Artif. Intell..

[62]  Wolfgang Bibel.  On Matrices with Connections , 1981, JACM.

[63]  Verónica Dahl.  Translating Spanish into Logic through Logic , 1981, Am. J. Comput. Linguistics.

[64]  Alain Colmerauer,et al.  Last Steps Towards an Ultimate PROLOG , 1981, IJCAI.

[65]  Jörg H. Siekmann,et al.  The Markgraf Karl Refutation Procedure , 1980, IJCAI.

[66]  K. M. Hörnig.  Generating small Models of First Order Axioms , 1981, GWAI.

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

[68]  Gérard P. Huet,et al.  A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm , 1981, J. Comput. Syst. Sci..

[69]  Vincent J. Digricoli.  The Efficacy of RUE Resolution Experimental Results and Heuristic Theory , 1981, IJCAI.

[70]  Warren D. Goldfarb,et al.  The Undecidability of the Second-Order Unification Problem , 1981, Theor. Comput. Sci..

[71]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[72]  Philip T. Cox,et al.  Deduction Plans: A Basis for Intelligent Backtracking , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[73]  Jack Minker,et al.  Advances in Data Base Theory: Volume 1 , 1981 .

[74]  Alberto Martelli,et al.  An Efficient Unification Algorithm , 1982, TOPL.

[75]  W. Bibel.  Computationally Improved Versions of Herbrand's Theorem , 1982 .

[76]  Wolfgang Bibel.  LOGICAL PROGRAM SYNTHESIS , 1982 .

[77]  Robert A. Kowalski,et al.  Logic for problem solving , 1982, The computer science library : Artificial intelligence series.

[78]  Raymond Reiter,et al.  Towards a Logical Reconstruction of Relational Database Theory , 1982, On Conceptual Modelling.

[79]  Wolfgang Bibel.  A Comparative Study of Several Proof Procedures , 1982, Artif. Intell..

[80]  Christoph Walther,et al.  A Many-Sorted Calculus Based on Resolution and Paramodulation , 1982, IJCAI.

[81]  Lenhart K. Schubert,et al.  From English to Logic: Context-Free Computation of ‘Conventional’ Logical Translation , 1982, CL.

[82]  Wolfgang Bibel,et al.  Improvements of a Tautology-Testing Algorithm , 1982, CADE.

[83]  F. Hayes-Roth.  Using Proofs and Refutations to Learn from Experience , 1983 .

[84]  Ehud Shapiro,et al.  Algorithmic Program Debugging , 1983 .

[85]  Elmar Eder.  Properties of Substitutions and Unifications , 1983, GWAI.

[86]  Martin Davis,et al.  Eliminating the Irrelevant from Mechanical Proofs , 1983 .

[87]  Larry Wos.  Automated Reasoning: Real Uses and Potential Uses , 1983, IJCAI.

[88]  Bertram Fronhöfer,et al.  Towards an Advanced Implementation of the Connection Method , 1983, IJCAI.

[89]  M. G. Wallace,et al.  Language as a cognitive process, vol I: Syntax, Terry Winograd, Addison‐Wesley, 1983. No. of pages: 640. ISBN 0 201 08571 2 , 1983 .

[90]  J. A. Robinson,et al.  Automatic Deduction with Hyper-Resolution , 1983 .

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

[92]  B. Dunham,et al.  Theorem Testing by Computer , 1983 .

[93]  Alan W. Biermann,et al.  Automatic Program Construction Techniques , 1984 .

[94]  Luís Moniz Pereira,et al.  Deduction Revision by Intelligent Backtracking , 1984, Implementations of Prolog.

[95]  Wolfgang Bibel,et al.  Towards a connection machine for logical inference , 1985, Future Gener. Comput. Syst..

[96]  Rolf Nossum.  Automated theorem proving methods , 1985, BIT Comput. Sci. Sect..

[97]  Wolfgang Bibel,et al.  Automated Inferencing , 1985, J. Symb. Comput..

[98]  Zohar Manna,et al.  The logical basis for computer programming , 1985 .

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

[100]  John W. Lloyd,et al.  A Basis for Deductive Database Systems , 1985, J. Log. Program..

[101]  Wolfgang Bibel,et al.  A Bibliography on Parallel Inference Machines , 1985, J. Symb. Comput..

[102]  Armin Haken,et al.  The Intractability of Resolution , 1985, Theor. Comput. Sci..

[103]  Jeffrey D. Ullman,et al.  Design Overview of the NAIL! System , 1986, ICLP.

[104]  Norbert Eisinger.  What You Always Wanted to Know About Clause Graph Resolution , 1986, CADE.

[105]  Christopher John Hogger,et al.  Introduction to logic programming , 1986, A.P.I.C. Studies in data processing.

[106]  John W. Lloyd,et al.  A Basis for Deductive Database Systems II , 1986, J. Log. Program..

[107]  Neil V. Murray,et al.  Inference with path resolution and semantic graphs , 1987, JACM.

[108]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.

[109]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[110]  J. A. NEWELLt,et al.  Empirical Explorations of the Logic Theory Machine : A Case Study in Heuristic , .