ACT-P: A Configurable Theorem-Power

There has been a considerable amount of research into the provision of explicit representation of control regimes for resolution-based theorem provers. However, most of the existing systems are either not adequate in that they do not allow the user to express any arbitrary control regime, or are too inefficient to be of practical use. In this paper a theorem prover, ACT-P, which is adequate but retains satisfactory efficiency is presented. It does so by providing a number of user-changeable heuristics which are called at specific points during the search for a proof. The set of user-changeable heuristics was determined on the basis of a classification of the heuristics used by existing resolution-based theorem provers.

[1]  Ewing Lusk,et al.  Automated reasoning system ITP , 1984 .

[2]  Frank van Harmelen,et al.  The architecture of Socrates. , 1989 .

[3]  Brian T. Smith.  Reference Manual for the Environmental Theorem Prover: an Incarnation of AURA , 1988 .

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

[5]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[6]  Nils J. Nilsson,et al.  Problem-solving methods in artificial intelligence , 1971, McGraw-Hill computer science series.

[7]  Guy L. Steele,et al.  Common Lisp the Language , 1984 .

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

[9]  Chin-Liang Chang.  The Unit Proof and the Input Proof in Theorem Proving , 1970, JACM.

[10]  Nigel Shadbolt,et al.  A Specification Tool for Planning Systems , 1990, ECAI.

[11]  Frank van Harmelen,et al.  Meta-Level Inference Systems , 1991 .

[12]  Tomás E. Uribe,et al.  An Overview of FRAPPS 2.0: A Framework for Resolution-based Automated Proof Procedure Systems , 1992, CADE.

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

[14]  Michael R. Genesereth,et al.  Logic programming , 1985, CACM.

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

[16]  Raymond Reiter.  Two Results on Ordering for Resolution with Merging and Linear Format , 1971, JACM.

[17]  Kave Eshghi.  Meta-language in logic programming , 1987 .

[18]  Peter B. Andrews.  Resolution With Merging , 1968, JACM.

[19]  C. Cecchi,et al.  Representation and use of metaknowledge , 1986, Proceedings of the IEEE.

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