An autonomous multistrategy theorem proving system using knowledge-based techniques

Most general-purpose theorem-proving systems have weak search control. There is no alternative to the use of a large number of heuristics or strategies for search guidance. Choosing appropriate strategies for solving a given problem may require the knowledge of different strategies and may involve a lot of painstaking trial-and-error. To encourage the widespread use of computer reasoning systems, it is important that a theorem prover be usable by those with little knowledge of problem-solving strategies, and that a theorem prover be able to select good strategies for the user. An autonomous multistrategy theorem-proving system is developed, using knowledge-based techniques, to entirely free the user from the necessity of understanding the system or the merits of different strategies. All the user has to do is input his or her problem in first-order logic, and the system solves the problem efficiently for him or her without any manual intervention. The system embodies much of expert knowledge about how to solve problems. The knowledge is represented as metarules in knowledge base which guide a hyperlinking theorem prover to solve problems automatically and efficiently.

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

[2]  David A. Plaisted,et al.  Use of unit clauses and clause splitting in automatic deduction , 1992, Proceedings ICCI `92: Fourth International Conference on Computing and Information.

[3]  Donald W. Loveland,et al.  An Implementation of the Model Elimination Proof Procedure , 1974, JACM.

[4]  Donald I. Good,et al.  An interactive program verification system , 1975 .

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

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

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

[8]  Andrew Stevens A Rational Reconstruction of Boyer and Moore's Technique for Constructing Induction Formulas , 1988, ECAI.

[9]  Jack J. Dongarra Advanced Computing Research Facility, Mathematics and Computer Science Division, Argonne National Laboratory , 1989, Int. J. High Perform. Comput. Appl..

[10]  Ewing L. Lusk,et al.  Non-horn problems , 2004, Journal of Automated Reasoning.

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

[12]  D. Loveland,et al.  Empirical explorations of the geometry-theorem proving machine , 1995 .

[13]  William McCune,et al.  OTTER 1.0 Users' Guide , 1990 .

[14]  Johan de Kleer,et al.  An Assumption-Based TMS , 1987, Artif. Intell..

[15]  Alan Bundy,et al.  The Use of Explicit Plans to Guide Inductive Proofs , 1988, CADE.

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

[17]  Peter Jackson,et al.  Introduction to expert systems , 1986 .

[18]  Margaret L. Lial,et al.  Mathematics with Applications , 1974 .

[19]  Mark E. Stickel A prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler , 1986, CADE.

[20]  David A. McAllester An Outlook on Truth Maintenance. , 1980 .

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

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

[23]  J. Denbigh Starkey,et al.  Experimental tests of resolution-based theorem-proving strategies , 1976, Inf. Sci..

[24]  Larry Wos,et al.  Efficiency and Completeness of the Set of Support Strategy in Theorem Proving , 1965, JACM.

[25]  D. Kirsh Foundations of Artificial Intelligence , 1991 .

[26]  J. A. Robinson,et al.  Theorem-Proving on the Computer , 1963, JACM.

[27]  David A. Plaisted,et al.  Use of replace rules in theorem proving , 1994, Methods Log. Comput. Sci..

[28]  David A. Plaisted,et al.  Eliminating duplication with the hyper-linking strategy , 1992, Journal of Automated Reasoning.

[29]  David A. Plaisted,et al.  A Complete Semantic Back Chaining Proof System , 1990, CADE.

[30]  T. Larrabee Efficient generation of test patterns using Boolean satisfiability , 1990 .

[31]  W. W. Bledsoe,et al.  Hierarchical deduction , 1987, Journal of Automated Reasoning.

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

[33]  Michael R. Genesereth,et al.  Logical foundations of artificial intelligence , 1987 .