The early years of logic programming

This firsthand recollection of those early days of logic programming traces the shared influences and inspirations that connected Edinburgh, Scotland, and Marseilles, France.

[1]  JOHN F. Young.  Machine Intelligence , 1971, Nature.

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

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

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

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

[6]  Robert A. Kowalski,et al.  Algorithm = logic + control , 1979, CACM.

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

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

[9]  Robert A. Kowalski,et al.  The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

[10]  Robert S. Boyer,et al.  Proving Theorems about LISP Functions , 1973, JACM.

[11]  Donald W. Loveland,et al.  Mechanical Theorem-Proving by Model Elimination , 1968, JACM.

[12]  John McCarthy,et al.  Coloring maps and the Kowalski doctrine , 1982 .

[13]  C. Cordell Green,et al.  Application of Theorem Proving to Problem Solving , 1969, IJCAI.

[14]  J. Strother Moore,et al.  Computational logic : structure sharing and proof of program properties , 1973 .

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

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

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

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

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