A Proof Procedure Using Connection Graphs

Various deficiencies of resolution systems are investigated and a new theorem-proving system designed to remedy those deficiencms is presented The system is notable for eliminating re- dundancies present in SL-resolutlon, for incorporating preprocessing procedures, for liberahzing the order in which subgoals can be activated, for incorporating multidirectmnal searches, and for giving immediate access to pairs of clauses which resolve Examples of how the new system copes with the defic2encies of other theorem-proving systems are chosen from the areas of predicate logic program- ming and language parsing. The paper emphasizes the historical development of the new system, beginning as a supplement to SL-resolution in the form of classificatmn trees and incorporating an analogue of the Waltz algorithm for picture Interpretation The paper ends with a discussion of the opportunities for using look-ahead to guide the search for proofs

[1]  L. Wos,et al.  The unit preference strategy in theorem proving , 1899, AFIPS '64 (Fall, part I).

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

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

[4]  Jane J. Robinson.  A review of automatic theorem-proving , 1967 .

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

[6]  Carl Hewitt,et al.  PLANNER: A Language for Proving Theorems in Robots , 1969, IJCAI.

[7]  Raymond Reiter.  The predicate elimination strategy in theorem proving , 1970, STOC '70.

[8]  R. Kowalski.  Studies in the completeness and efficiency of theorem-proving by resolution , 1970 .

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

[10]  W. W. Bledsoe,et al.  Review of "Problem-Solving Methods in Artificial Intelligence by Nils J. Nilsson", McGraw-Hill Pub. , 1971, SGAR.

[11]  W. W. Bledsoe,et al.  Splitting and Reduction Heuristics in Automatic Theorem Proving , 1971, Artif. Intell..

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

[13]  Robert S. Boyer,et al.  Computer Proofs of Limit Theorems , 1971, IJCAI.

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

[15]  S BoyerRoger,et al.  Ttle sharing of structure in theorem proving programs , 1972 .

[16]  A. M. Geoffrion,et al.  Integer Programming Algorithms: A Framework and State-of-the-Art Survey , 1972 .

[17]  W. W. Bledsoe,et al.  A Man-Machine Theorem-Proving System , 1973, IJCAI.

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

[19]  David Gelperin,et al.  Deletion-Directed Search in Resolution-Based Proof Procedures , 1973, IJCAI.

[20]  Rona B. Stillman.  The Concept of Weak Substitution in Theorem-Proving , 1973, JACM.

[21]  David Wilkins.  A non-clausal theorem proving system , 1974 .

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

[23]  Donald Michie,et al.  Machine Intelligence 7 , 1975 .