The early years of logic programming

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The early years of logic programming

Full text

Pdf (716 KB)

Source

Communications of the ACM archive
Volume 31 , Issue 1 (January 1988) table of contents

Pages: 38 - 43

Year of Publication: 1988

ISSN:0001-0782

Author

Robert A. Kowalski

Univ. of London, London, UK

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 10, Downloads (12 Months): 39, Citation Count: 10

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/35043.35046 What is a DOI?

ABSTRACT

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

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Boyer, R.S., and Moore, JS. The sharing of structure in theorem proving programs. In Machine Intelligence, vol. 7, B. Meltzer and D. Michie, Eds. Edinburgh University Press, Edinburgh, U.K., pp. 101-116.
	2	Robert S. Boyer , J. Strother Moore, Proving Theorems about LISP Functions, Journal of the ACM (JACM), v.22 n.1, p.129-144, Jan. 1975 [doi>10.1145/321864.321875]
	3	Clark, K.L. Negation as failure. In Logic and Data Bases, H. Gallaire and J. Minker, Eds. Plenum, New York, 1978, pp. 293-322.
	4	Clark, K.L., McCabe, F.G., and Gregory, S. IC-PROLOG language features. In Logic Programming, K.L. Clark and S.-A. T~Lrnlund, Eds. Academic Press, New York, pp. 253-266.
	5	Colmerauer, A. Les Syst/~mes-Q ou un formalisme pour analyser et synth6tiser des phrases sur ordinateur. Rep. 43, Dept. of Computer Science, Univ. of Montreal, Quebec, 1970.
	6	Colmerauer, A., Kanoui, H., Pasero, R., and Roussel, P. Un syst~me de communication homme-machine en Frangais. Rep., Groupe d'Intelligence Artificielle, Univ. d'Aix Marseille II, Luminy, France, 1973.
	7	Elcock, E.W. Descriptions. In Machine Intelligence, voI. 3, D. Michie, Ed. Oliver and Boyd, Edinburgh, U.K., 1968, pp. 173-180.
	8	Foster, J.J., and Etcock, E.W. Absys 1: An incremental compiler for assertions--An introduction. In Machine Intelligence, vol. 4, D. Michie, Ed. Edinburgh University Press, Edinburgh, U.K., pp. 423-429.
	9	Foster, J.M. Assertions: Programs written without specifying unnecessary order. In Machine Intelligence, vol. 3, D. Michie, Ed. Edinburgh University Press, Edinburgh, U.K., 1968, pp. 387-392.
	10	Green, C.C. Application of theorem-proving to problera solving. In Proceedings of I}CAI-1, D.E. Walker and L.M. Norton, Eds. (Washington, D.C.). IJCAI, 1969, pp. 219-240.
	11	Hayes, P.J. Computation and deduction. In Proceedings of the 2nd MFCS Symposium. Czechoslovak Academy of Sciences, 1973, pp. 105-118.
	12	Hewitt, C. PLANNER: A language for proving theorems in robots. In Proceedings of IJCAI-1 (Washington, D.C.). IJCAI, 1969, pp. 295-301.
	13	Hill, R. LUSH resolution and its completeness. DCL Memo 78, School of Artificial Intelligence, Univ. of Edinburgh, U.K., Aug. 1974.
	14	Kowalski, R.A. Search strategies for theorem proving. In Machine Intelligence, vol. 5, B. Meltzer and D. Michie, Eds. Edinburgh University Press, Edinburgh, U.K., 1969, pp. 181-201.
	15	Kowalski, R.A. The predicate calculus as a programming language. In Proceedings of the International Symposium and Summer School on Mathematical Foundations of Computer Science (Jablonna, Poland, Aug.}. 1972.
	16	Kowalski, R.A. Predicate logic as a programming language. DCL Memo 70, School of Artificial Intelligence, Univ. of Edinburgh, U.K., Nov. 1973. (Also in Proceedings of IFIP 1974 {Stockholm, Sweden). North-Holland, Amsterdam, 1974, pp. 569-574).
	17	Robert Kowalski, A Proof Procedure Using Connection Graphs, Journal of the ACM (JACM), v.22 n.4, p.572-595, Oct. 1975 [doi>10.1145/321906.321919]
	18	Robert A. Kowalski, Logic for Problem Solving, Prentice Hall PTR, Upper Saddle River, NJ, 1979
	19	Robert Kowalski, Algorithm = logic + control, Communications of the ACM, v.22 n.7, p.424-436, July 1979 [doi>10.1145/359131.359136]
	20	Robert Kowalski, Logic for problem-solving, North-Holland Publishing Co., Amsterdam, The Netherlands, 1986
	21	Kowalski, R.A., and Kuehner, D. Linear resolution with selection function. School of Artificial Intelligence, DCL Memo 34, Univ. of Edinburgh, U.K., 1971. (Also: Artif. IntelL 2 (1971), 227-260.)
	22	Donald W. Loveland, Mechanical Theorem-Proving by Model Elimination, Journal of the ACM (JACM), v.15 n.2, p.236-251, April 1968 [doi>10.1145/321450.321456]
	23	Loveland, D.W. A linear format for resolution. In Proceedings of the INRIA Symposium on Automatic Demonstration. Springer-Verlag, New York, 1970, pp. 147-162.
	24	Luckham, D. Refinement theorems in resolution theory. In Proceedings of the INRIA Symposium on Automatic Demonstration. Springer- Verlag, New York, 1970, pp. 163-190. December 1968, Rocquencourt, France.
	25	McCarthy, J. Coloring maps and the Kowalski doctrine. 1982. Unpublished. Stanford University.
	26	McDermott, D. Critique of pure reason. Comput. IntelI. To be published.
	27	Moore, J. Computational logic: Structure sharing and proof of program properties, Parts I and ii. DCL Memo 67, School of Artificial Intelligence, Univ. of Edinburgh, Edinburgh, U.K., 1974.
	28	Raymond Reiter, Two Results on Ordering for Resolution with Merging and Linear Format, Journal of the ACM (JACM), v.18 n.4, p.630-646, Oct. 1971 [doi>10.1145/321662.321678]
	29	J. A. Robinson, A Machine-Oriented Logic Based on the Resolution Principle, Journal of the ACM (JACM), v.12 n.1, p.23-41, Jan. 1965 [doi>10.1145/321250.321253]
	30	Roussel, P. Definition et traitement de l'egalit6 formelle en d6monstration automatique. Thesis, Facult~ des Sciences, Univ. d'Aix- Marseille, Luminy, France, 1972.
	31	M. H. Van Emden , R. A. Kowalski, The Semantics of Predicate Logic as a Programming Language, Journal of the ACM (JACM), v.23 n.4, p.733-742, Oct. 1976 [doi>10.1145/321978.321991]
	32	Warren, D.H.D. Higher-order extensions to PROLOG: Are they needed? In Machine Intelligence, vol. 10, J.E. Hayes and D. Michie, Eds. Wiley, New York, 1982, pp. 441-454.

CITED BY 10

	Alain Colmerauer , Philippe Roussel, The birth of Prolog, ACM SIGPLAN Notices, v.28 n.3, p.37-52, March 1993
	Mengchi Liu, Deductive database languages: problems and solutions, ACM Computing Surveys (CSUR), v.31 n.1, p.27-62, March 1999
	J. A. Robinson, Logic and logic programming, Communications of the ACM, v.35 n.3, p.40-65, March 1992
	Toshinori Munakata, Notes on implementing sets in Prolog, Communications of the ACM, v.35 n.3, p.112-120, March 1992
	Donald MacKenzie, The Automation of Proof: A Historical and Sociological Exploration, IEEE Annals of the History of Computing, v.17 n.3, p.7-29, September 1995
	Alain Colmerauer , Philippe Roussel, The birth of Prolog, History of programming languages---II, ACM Press, New York, NY, 1996
	Matthew Huntbach, Search in concurrent logic languages, Proceedings of the 1995 ACM symposium on Applied computing, p.164-170, February 26-28, 1995, Nashville, Tennessee, United States
	Andrew Davison, 15th July 1972: a significant moment for logic programming, ACM SIGPLAN Notices, v.28 n.4, p.58-60, April 1993
	Jacques Cohen, A tribute to Alain Colmerauer, Theory and Practice of Logic Programming, v.1 n.6, p.637-646, November 2001
	G. A. Ringwood, SLD: a folk acronym?, ACM SIGPLAN Notices, v.24 n.5, p.71-75, May 1989