Prolog in 10 figures

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Prolog in 10 figures

Full text

Pdf (1.43 MB)

Source

Communications of the ACM archive
Volume 28 , Issue 12 (December 1985) table of contents

Pages: 1296 - 1310

Year of Publication: 1985

ISSN:0001-0782

Author

Alain Colmerauer

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 12, Downloads (12 Months): 64, Citation Count: 12

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/214956.214958 What is a DOI?

ABSTRACT

In the fall of 1981, a Japanese report officially initiated the quest for fifth-generation computers that would encompass the functions of knowledge processing and artificial intelligence. The conceptual underpinnings behind Prolog—Japan's language of choice for these activities—are presented here in a way that suggests why Prolog or a similar language might be considered a model for designing the computers of the future.

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	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]
	2	Robinson. J.A. Logic: Form and Function. Edinburgh University Press. Scotland. and Elsevier North-Holland. New York. 1979.
	3	Robert Kowalski, Logic for problem-solving, North-Holland Publishing Co., Amsterdam, The Netherlands, 1986
	4	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]
	5	Colmerauer. A. Les systemes-q ou un formalisme pour analyser et synthetiser des phrases sur ordinateur. Intern. Rep. 43, Departement d'informatique, Universite de Montreal, Canada, Sept. 1979.
	6	Colmerauer. A., Kanoui. H., Pasero. R., and Roussel. P. Un systeme de communication homme-machine en francais. Res. Rep. Groupe d'Intelligence Artificielle. Facule des Sciences de Luminy. Marseilles, France. 1973.
	7	Roussel. P. Prolog, manuel de reference et d'Utilisation. Groupe d'Intelligence Artificielle. Faculte des Sciences de Luminy, Marseilles, France. 1975.
	8	Colmerauer. A. Prolog and infinite trees. In Logic Programming. K.L. Clark and S.A. Tarnlund, Eds. Academic Press. New York. 1982.
	9	Colmerauer. A. Equations and inequations on finite and infinite trees. invited lecture. In Proceeditlgs of fhe Intemafioml Conference on Fifth Generation Computer Systems. Tokyo, Japan. Nov. 1984.
	10	Colmerauer. A., Kanoui, H., and Van Caneghem. M. Prolog, theoretical principle and current trends. Trch. Sri. Inf. 2, 4 (1983).
	11	Françis Giannesini , Henry Kanoui , Robert Pasero , Michel van Caneghem, Prolog, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
	12	Pique. J.F. Drawing trees and their equations in Prolog. In Proceedings of the 2nd International Logic Programming Conference, S.A. Tarnlund. Ed. Uppsala Univ., Sweden. July 1984.
	13	Van Caneghem. M. L'Anatomie de Prolog II. Thesis, Faculty of Sciences of Luminy. Univ. of Marseille II. France, Oct. 1984.
	14	Van Emden. M., and Lloyd. J.W. A logical reconstruction of Prolog II. J. Logic Program. 1 (1984).

CITED BY 12

	Mengchi Liu, Deductive database languages: problems and solutions, ACM Computing Surveys (CSUR), v.31 n.1, p.27-62, March 1999
	John Najarian, Modeling in Prolog, ACM SIGCSE Bulletin, v.20 n.1, p.259-262, Feb. 1988
	Jack Minker, Introduction to logic-based artificial intelligence, Logic-based artificial intelligence, Kluwer Academic Publishers, Norwell, MA, 2000
	Robert L. Ashenhurst, ACM forum, Communications of the ACM, v.29 n.3, p.173, March 1986
	Alain Colmerauer, An introduction to Prolog III, Communications of the ACM, v.33 n.7, p.69-90, July 1990
	C. Jard , J. F. Monin , R. Groz, Development of Veda, a Prototyping Tool for Distributed Algorithms, IEEE Transactions on Software Engineering, v.14 n.3, p.339-352, March 1988
	Bruce S. Elenbogen , Martha R. O'Kennon, Teaching recursion using fractals in Prolog, ACM SIGCSE Bulletin, v.20 n.1, p.263-266, Feb. 1988
	Tim Wahls , Gary T. Leavens , Albert L. Baker, Executing Formal Specifications with Concurrent Constraint Programming, Automated Software Engineering, v.7 n.4, p.315-343, December 2000
	J. Calmet , J. A. Campbell, A perspective on symbolic mathematical computing and artificial intelligence, Annals of Mathematics and Artificial Intelligence, v.19 n.3-4, p.261-277, 1997
	Erich Schikuta, An exemplary approach to the education of rule-based languages, ACM SIGCSE Bulletin, v.19 n.2, p.43-45, June 1987
	Guy A. Narboni, From Prolog III to Prolog IV: The Logic of Constraint ProgrammingRevisited, Constraints, v.4 n.4, p.313-335, December 1999
	François Fages , Emmanuel Coquery, Typing constraint logic programs, Theory and Practice of Logic Programming, v.1 n.6, p.751-777, November 2001