article

Free access

Prolog in 10 figures

Author:

Alain ColmerauerAuthors Info & Claims

Communications of the ACM, Volume 28, Issue 12

Pages 1296 - 1310

https://doi.org/10.1145/214956.214958

Published: 01 December 1985 Publication History

PDF eReader

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

[1]

Robinson. J.A. A machine-oriented logic based on the resolution principle. J. ACM 12. 1 (Jan. 1965). 23-41.

Digital Library

Google Scholar

[2]

Robinson. J.A. Logic: Form and Function. Edinburgh University Press. Scotland. and Elsevier North-Holland. New York. 1979.

Google Scholar

[3]

Kowalski. R.A. Logic for Problem Solving. Artificial Intelligence Series. N.J. Nilsson. Ed. North-Holland. Amsterdam. 1979.

Digital Library

Google Scholar

[4]

Kowalski. R.A., and van Emden. M.H. The semantics of predicate logic as a programming language. J. ACM 23, 4 (Oct. 1976). 733-742.

Digital Library

Google Scholar

[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.

Google Scholar

[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.

Google Scholar

[7]

Roussel. P. Prolog, manuel de reference et d'Utilisation. Groupe d'Intelligence Artificielle. Faculte des Sciences de Luminy, Marseilles, France. 1975.

Google Scholar

[8]

Colmerauer. A. Prolog and infinite trees. In Logic Programming. K.L. Clark and S.A. Tarnlund, Eds. Academic Press. New York. 1982.

Google Scholar

[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.

Google Scholar

[10]

Colmerauer. A., Kanoui, H., and Van Caneghem. M. Prolog, theoretical principle and current trends. Trch. Sri. Inf. 2, 4 (1983).

Google Scholar

[11]

Giannesini. F., Kanoui, H., Pasero. R., and Van Caneghem, M. Prolog. InterEdition. Paris. 1965. (English version by Addison-Wesley, Reading. Mass., will appear in 1986.)

Digital Library

Google Scholar

[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.

Google Scholar

[13]

Van Caneghem. M. L'Anatomie de Prolog II. Thesis, Faculty of Sciences of Luminy. Univ. of Marseille II. France, Oct. 1984.

Google Scholar

[14]

Van Emden. M., and Lloyd. J.W. A logical reconstruction of Prolog II. J. Logic Program. 1 (1984).

Google Scholar

Cited By

View all

Papini O(2024)Intelligence Artificielle à Marseille. Quelques repères historiquesRevue Ouverte d'Intelligence Artificielle10.5802/roia.795:2-3(205-219)Online publication date: 26-Sep-2024
https://doi.org/10.5802/roia.79
Papini ORisch V(2024)Introduction (FR)Revue Ouverte d'Intelligence Artificielle10.5802/roia.69fr5:2-3(1-16)Online publication date: 26-Sep-2024
https://doi.org/10.5802/roia.69fr
Papini ORisch V(2024)Introduction (EN)Revue Ouverte d'Intelligence Artificielle10.5802/roia.69en5:2-3(17-29)Online publication date: 26-Sep-2024
https://doi.org/10.5802/roia.69en
Show More Cited By

Index Terms

Prolog in 10 figures
1. Software and its engineering
  1. Software notations and tools
    1. Context specific languages
2. Theory of computation
  1. Logic
  2. Models of computation
    1. Computability

Recommendations

Towards a jitting VM for prolog execution
PPDP '10: Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming

Most Prolog implementations are implemented in low-level languages such as C and are based on a variation of the WAM instruction set, which enhances their performance but makes them hard to write. In addition, many of the more dynamic features of Prolog ...
A plea for readable pleas for a readable Prolog programming style

Writing a plea for a readable Prolog programming style is not like writing most pleas. In writing a plea for a readable Prolog programming style in particular, one could possibly bring forth many results. This means that special care must be taken when ...
Concurrent PROLOG: Collected Papers

Comments

Information & Contributors

Information

Published In

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1985

Published in CACM Volume 28, Issue 12

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

57
Total Citations
View Citations
1,175
Total Downloads

Downloads (Last 12 months)166
Downloads (Last 6 weeks)18

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Papini O(2024)Intelligence Artificielle à Marseille. Quelques repères historiquesRevue Ouverte d'Intelligence Artificielle10.5802/roia.795:2-3(205-219)Online publication date: 26-Sep-2024
https://doi.org/10.5802/roia.79
Papini ORisch V(2024)Introduction (FR)Revue Ouverte d'Intelligence Artificielle10.5802/roia.69fr5:2-3(1-16)Online publication date: 26-Sep-2024
https://doi.org/10.5802/roia.69fr
Papini ORisch V(2024)Introduction (EN)Revue Ouverte d'Intelligence Artificielle10.5802/roia.69en5:2-3(17-29)Online publication date: 26-Sep-2024
https://doi.org/10.5802/roia.69en
Li Y(2017)Structural Resolution with Co-inductive Loop DetectionElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.258.4258(52-67)Online publication date: 13-Sep-2017
https://doi.org/10.4204/EPTCS.258.4
Morin J(2016)Prédicats théoriques et données externes: syntaxe diachroniqueCanadian Journal of Linguistics/Revue canadienne de linguistique10.1017/S000841310001323233:04(443-475)Online publication date: 27-Jun-2016
https://doi.org/10.1017/S0008413100013232
(2012)ReferencesLees' Loss Prevention in the Process Industries10.1016/B978-0-12-397189-0.00123-3(3129-3580)Online publication date: 2012
https://doi.org/10.1016/B978-0-12-397189-0.00123-3
Jämsen JNiemi TJärvelin K(2010)Derived types in semantic association discoveryJournal of Intelligent Information Systems10.1007/s10844-009-0094-735:2(213-244)Online publication date: 1-Oct-2010
https://dl.acm.org/doi/10.1007/s10844-009-0094-7
Bond A(2009)A predicate logic approach to CAD/CAM modelingArtificial Intelligence for Engineering, Design, Analysis and Manufacturing10.1017/S08900604000029366:01(39)Online publication date: 27-Feb-2009
https://doi.org/10.1017/S0890060400002936
Schwartz DChen S(2009)A constraint-based approach for qualitative matrix structural analysisArtificial Intelligence for Engineering, Design, Analysis and Manufacturing10.1017/S08900604000020679:01(23)Online publication date: 27-Feb-2009
https://doi.org/10.1017/S0890060400002067
Rossi RTarim SHnich BPrestwich SKaracaer S(2009)Scheduling internal audit activities: a stochastic combinatorial optimization problemJournal of Combinatorial Optimization10.1007/s10878-009-9207-z19:3(325-346)Online publication date: 21-Jan-2009
https://doi.org/10.1007/s10878-009-9207-z
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Towards a jitting VM for prolog execution

A plea for readable pleas for a readable Prolog programming style

Concurrent PROLOG: Collected Papers

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations