Automated theorem proving: mapping logic into AI

Logic can be defined as the formal study of reasoning; if we replace “formal” by “mechanical” we can place almost the entire set of methodologies used in the field of automated theorem proving (ATP) within the scope of logic. Because of the goals of ATP, if not always the methodologies, ATP has been considered to be within the domain of AI. We explore the methodologies of ATP, including the logics that underlie the theorem provers, and discuss some of the mechanisms that utilize these logics. These include term rewriting systems, mathematical induction, inductionless induction and even mixed integer programming. The ATP field, via resolution, has even provided the foundation for an exciting AI and database programming language, PROLOG. We conclude with a new method for extending the PROLOG system to work with non-Horn clause sets within a positive logic format, particularly simple for “slightly non-Horn” clause sets.

[1]  George E. Lindamood,et al.  The structure of the Japanese fifth generation computer project - then and now , 1984, Future Gener. Comput. Syst..

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

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

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

[5]  Donald W. Loveland,et al.  Automated theorem proving: a quarter-century review , 1984 .

[6]  Elliott Mendelson,et al.  Introduction to mathematical logic (3. ed.) , 1987 .

[7]  David R. Musser,et al.  On proving inductive properties of abstract data types , 1980, POPL '80.

[8]  Peter B. Andrews.  An introduction to mathematical logic and type theory - to truth through proof , 1986, Computer science and applied mathematics.

[9]  Peter B. Andrews,et al.  AUTOMATING HIGHER-ORDER LOGIC , 1984 .

[10]  Rance Cleaveland,et al.  Implementing mathematics with the Nuprl proof development system , 1986 .

[11]  J. C. Shaw,et al.  Empirical explorations of the logic theory machine: a case study in heuristic , 1899, IRE-AIEE-ACM '57 (Western).

[12]  William McCune,et al.  Logic Machine Architecture: Kernel Funtions , 1982, CADE.

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

[14]  Patrick Suppes,et al.  Student use of an interactive theorem prover , 1984 .

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

[16]  Joseph A. Goguen,et al.  How to Prove Algebraic Inductive Hypotheses Without Induction , 1980, CADE.

[17]  Donald E. Knuth,et al.  Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research. , 1970 .

[18]  Mark E. Stickel,et al.  A Case Study of Theorem Proving by the Knuth-Bendix Method: Discovering That x³=x Implies Ring Commutativity , 1984, CADE.

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

[20]  David A. Plaisted,et al.  A Simplified Problem Reduction Format , 1982, Artif. Intell..

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

[22]  J. S. Moore,et al.  Proof-Checking, Theorem Proving, and Program Verification. , 1983 .

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

[24]  Lawrence J. Henschen,et al.  What Is Automated Theorem Proving? , 1985, J. Autom. Reason..

[25]  Dale Miller,et al.  Expansion Tree Proofs and Their Conversion to Natural Deduction Proofs , 1984, CADE.

[26]  Michael J. O'Donnell,et al.  Equational Logic as a Programming Language , 1985, Logic of Programs.

[27]  Greg Nelson,et al.  Fast Decision Procedures Based on Congruence Closure , 1980, JACM.

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

[29]  Patrick Suppes,et al.  Introduction To Logic , 1958 .

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

[31]  P. J. Cohen.  Set Theory and the Continuum Hypothesis , 1966 .

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

[33]  Robert E. Shostak,et al.  Deciding Combinations of Theories , 1982, JACM.

[34]  Greg Nelson,et al.  Simplification by Cooperating Decision Procedures , 1979, TOPL.

[35]  R. Kowalski,et al.  Linear Resolution with Selection Function , 1971 .

[36]  Larry Wos,et al.  Automated Reasoning: Introduction and Applications , 1984 .

[37]  J. K. Lowe,et al.  Some results and experiments in programming techniques for propositional logic , 1986, Comput. Oper. Res..