The DOI matches its Crossref record; 21 of the 22 references it cites were found in a registry or an index.
The birth of Prolog
Open accessAbstract
The programming language, Prolog, was born of a project aimed not at producing a programming language but at processing natural languages; in this case, French. The project gave rise to a preliminary version of Prolog at the end of 1971 and a more definitive version at the end of 1972. This article gives the history of this project and describes in detail the preliminary and then the final versions of Prolog. The authors also felt it appropriate to describe the Q-systems since it was a language which played a prominent part in Prolog's genesis.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Prolog (Kowalski, 1988; Colmerauer & Roussel, 1993) is a logic programming language based on SLD-resolution and is therefore restricted to Horn clauses.”
From Inductive Logic Programming At 30: A New Introduction (2022) · cites this paper as Colmerauer & Roussel, 1993
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Machine-Oriented Logic Based on the Resolution Principle
Robinson, J. A. (1965) · Journal of the ACM · doi:10.1145/321250.321253 · Cited by 4,012
The Semantics of Predicate Logic as a Programming Language
van Emden, M. H., & Kowalski, R. (1976) · Journal of the ACM · doi:10.1145/321978.321991 · Cited by 1,449
Pereira, F. C. N., & Warren, D. H. D. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90003-x · Cited by 978
Green, C. (1981) · Elsevier eBooks · doi:10.1016/b978-0-934613-03-3.50019-2 · Cited by 459
Floyd, R. W. (1967) · Journal of the ACM · doi:10.1145/321420.321422 · Cited by 369
Syntactic Analysis and Operator Precedence
Floyd, R. W. (1963) · Journal of the ACM · doi:10.1145/321172.321179 · Cited by 252
Prolog - the language and its implementation compared with Lisp
Warren, D. H. D., Pereira, L. M. C., & Pereira, F. M. B. (1977) · doi:10.1145/800228.806939 · Cited by 241
Colmerauer, A. (2005) · Springer eBooks · doi:10.1007/bfb0031371 · Cited by 232
Self-citationPLANNER: a language for proving theorems in robots
Hewitt, C. E. (1969) · International Joint Conference on Artificial Intelligence · Cited by 210
The early years of logic programming
Kowalski, R. A. (1988) · Communications of the ACM · doi:10.1145/35043.35046 · Cited by 176
Flagged first, then by citations
1 of the 22 references couldn’t be matched to a known paper.
Research works printed but not linked: 23
- Battani G6rard et Henry Meloni , lnterprEteur du langage PROLOG , DEA report, Groupe Intelligence Artificielle, Facult6 des Sciences de Luminy, Universit6 Aix-Marseille II , France , 1973 . Battani G6rard et Henry Meloni, lnterprEteur du langage PROLOG, DEA report, Groupe Intelligence Artificielle, Facult6 des Sciences de Luminy, Universit6 Aix-Marseille II, France, 1973.
- Battani G6rard , Mise en oeuvre des contraintes phonologiques, syntaxiques et sEmantiques dans un syst~me de comprehension automatique de la parole, 3(~me cycle thesis , Groupe Intelligence Artificielle, Facult~ des Sciences de Luminy, Universit6 Aix-Marseille II , France , June 1975 . Battani G6rard, Mise en oeuvre des contraintes phonologiques, syntaxiques et sEmantiques dans un syst~me de comprehension automatique de la parole, 3(~me cycle thesis, Groupe Intelligence Artificielle, Facult~ des Sciences de Luminy, Universit6 Aix-Marseille II, France, June 1975.
- Bergman Marc and Henry Kanoui , Application of mechanical theorem proving to symbolic calculus, Third International Colloquium on advanced Computing Methods in Theoretical Physics , Marseilles , France , June 1973 . Bergman Marc and Henry Kanoui, Application of mechanical theorem proving to symbolic calculus, Third International Colloquium on advanced Computing Methods in Theoretical Physics, Marseilles, France, June 1973.
- R~solution par la demonstration automatique de quelques problEmes en integration symbolique sur calculateur, 3(~me cyle thesis, Groupe Intelligence Artificielle, Facult6 des Sciences de Luminy , Universit~ Aix- Marseille II , France , October 1973 . R~solution par la demonstration automatique de quelques problEmes en integration symbolique sur calculateur, 3(~me cyle thesis, Groupe Intelligence Artificielle, Facult6 des Sciences de Luminy, Universit~ Aix- Marseille II, France, October 1973.
- Bergman Marc and Henry Kanoui , SYCOPHANTE , systEme de calcul formel sur ordinateur, final report for a DRET contract (Direction des Recherches et Etudes Techniques) , Groupe Intelligence Artificielle, Facult6 des Sciences de Luminy, Universit6 Aix-Marseille II , France , 1975 . Bergman Marc and Henry Kanoui, SYCOPHANTE, systEme de calcul formel sur ordinateur, final report for a DRET contract (Direction des Recherches et Etudes Techniques), Groupe Intelligence Artificielle, Facult6 des Sciences de Luminy, Universit6 Aix-Marseille II, France, 1975.
- Boyer Roger S. and Jay S . Moore , Ttle sharing of Structure in Theorem Proving Programs, Machine Intelligence 7, edited by B. Melzer et D. Michie , Edinburgh University Press , New York , pp. 101 - 116 , 1972 . Boyer Roger S. and Jay S. Moore, Ttle sharing of Structure in Theorem Proving Programs, Machine Intelligence 7, edited by B. Melzer et D. Michie, Edinburgh University Press, New York, pp. 101-116, 1972.
- Chomsky Noam , Aspects of the Theond of Syntax , MIT Press , Cambridge , 1965 Chomsky Noam, Aspects of the Theond of Syntax, MIT Press, Cambridge, 1965
- Les systEmes-q ou un formalisme pour analyser et synth~;tiser des phrases sur ordinateur , Internal publication 43 , D6partement d'informatique de l'Universit~ de Montr6al , September 1970 . Les systEmes-q ou un formalisme pour analyser et synth~;tiser des phrases sur ordinateur, Internal publication 43, D6partement d'informatique de l'Universit~ de Montr6al, September 1970.
- Colmerauer Alain , Fernand Didier , Robert Pasero , Philippe Roussel , Jean Trudel , REpondre a , Internal publication, Groupe Intelligence Artificielle, Facult~ des Sciences de Luminy, Universit6 Aix-Marseille II , France, May 1971 . This publication is a computer print-out with handwritten remarks. Colmerauer Alain, Fernand Didier, Robert Pasero, Philippe Roussel, Jean Trudel, REpondre a, Internal publication, Groupe Intelligence Artificielle, Facult~ des Sciences de Luminy, Universit6 Aix-Marseille II, France, May 1971. This publication is a computer print-out with handwritten remarks.
- Colmerauer Alain , Henry Kanoui , Robert Pasero et Philippe Roussel , U n systEme de communication en fran~ais, rapport pr61iminaire de fin de contrat IRIA, Groupe Intelligence Artificielle, Facult~ des Sciences de Luminy, Universit6 Aix-Marseille II , France , October 1972 . Colmerauer Alain, Henry Kanoui, Robert Pasero et Philippe Roussel, U n systEme de communication en fran~ais, rapport pr61iminaire de fin de contrat IRIA, Groupe Intelligence Artificielle, Facult~ des Sciences de Luminy, Universit6 Aix-Marseille II, France, October 1972.
- Darlington J.L. Theorem-proving and information retrieval. Machine Intelligence 4 , Edinburgh University Press , pp. 173 - 707 , 1969 . Darlington J.L. Theorem-proving and information retrieval. Machine Intelligence 4, Edinburgh University Press, pp. 173-707, 1969.
- Green Cordell C. , Application of theorem-proving to problem-solving , Proceedings of First International Joint Conference on Artificial Intelligence, Washington D.C. , pp. 219 - 239 , 1969 . Green Cordell C., Application of theorem-proving to problem-solving, Proceedings of First International Joint Conference on Artificial Intelligence, Washington D.C., pp. 219-239, 1969.
- Joubert Michel , Un syst~me de r~.solution de problbmes i~ tendance naturelle, 3(~me cycle thesis, Groupe Intelligence Artificielle, Facult~ des Sciences de Luminy , Universit~ Aix-Marseille II , France , February 1974 . Joubert Michel, Un syst~me de r~.solution de problbmes i~ tendance naturelle, 3(~me cycle thesis, Groupe Intelligence Artificielle, Facult~ des Sciences de Luminy, Universit~ Aix-Marseille II, France, February 1974.
- Kanoui Henry , Application de la d~.monstration automatique aux manipulations alg~,briques el a l'int~gration formelle sur ordinateur, 3~me cycle thesis , Groupe Intelligence Artificielle, Faculta des Sciences de Luminy, Universit6 Aix-Marseille II , France , October 1973 . Kanoui Henry, Application de la d~.monstration automatique aux manipulations alg~,briques el a l'int~gration formelle sur ordinateur, 3~me cycle thesis, Groupe Intelligence Artificielle, Faculta des Sciences de Luminy, Universit6 Aix-Marseille II, France, October 1973.
- Kowalski Rober .t A. et D. Kuehner , Linear resolution with selection function, memo 78 , University of Edinburgh , School of Artificial Intelligence, 1971 . Also in ArtijSchd Intelligence 2, 3, pp. 227 - 260 . Kowalski Rober.t A. et D. Kuehner, Linear resolution with selection function, memo 78, University of Edinburgh, School of Artificial Intelligence, 1971. Also in ArtijSchd Intelligence 2, 3, pp. 227-260.
- Kowalski Robert A. , Predicate Logic as Programming Language, memo 70 , University of Edimburgh, School of Artificial Intelligence, November 1973 . Also in Proceedings of IFIP 1974, North Holland Publishing Company , Amsterdam, pp. 569 - 574 , 1974. Kowalski Robert A., Predicate Logic as Programming Language, memo 70, University of Edimburgh, School of Artificial Intelligence, November 1973. Also in Proceedings of IFIP 1974, North Holland Publishing Company, Amsterdam, pp. 569-574, 1974.
- Meloni Henry , Mise en oeuvre des contraintes phonologiques, syntaxiques et s~,mantiques darts un syst~me de comprehension automatique de la parole, th(~se de 3(~me cycle , Groupe Intelligence Artificielle, Facult~ des Sciences de Luminy , Universit~ Aix-Marseille II , France, June 1975 . Meloni Henry, Mise en oeuvre des contraintes phonologiques, syntaxiques et s~,mantiques darts un syst~me de comprehension automatique de la parole, th(~se de 3(~me cycle, Groupe Intelligence Artificielle, Facult~ des Sciences de Luminy, Universit~ Aix-Marseille II, France, June 1975.
- Moore, Jay , Computational Logic : Structure sh,lring and proof of program properties, part I and II, memo 67 , University of Edinburgh , School of Artificial Intelligence, 1974 . Moore, Jay, Computational Logic : Structure sh,lring and proof of program properties, part I and II, memo 67, University of Edinburgh, School of Artificial Intelligence, 1974.
- Pasero Robert , Representation du fran~;ais en logique du premier ordre en vue de dialoguer avec un ordinateur, th~se de 3i~me cycle, Groupe Intelligence Artificielle, Facult~ des Sciences de Luminy , Universit~ Aix- Marseille II , France , May 1973 . Pasero Robert, Representation du fran~;ais en logique du premier ordre en vue de dialoguer avec un ordinateur, th~se de 3i~me cycle, Groupe Intelligence Artificielle, Facult~ des Sciences de Luminy, Universit~ Aix- Marseille II, France, May 1973.
- Roussel Philippe , D~finition et traitement ,le l'~;$alitL ; formelle en d~monstration automatique, th(~se de 3i~me cycle, Groupe Intelligence Artificielle , Facult(~ des Sciences de Luminy, Universit~ Aix-Marseille II, France, May 1972 . Roussel Philippe, D~finition et traitement ,le l'~;$alitL; formelle en d~monstration automatique, th(~se de 3i~me cycle, Groupe Intelligence Artificielle, Facult(~ des Sciences de Luminy, Universit~ Aix-Marseille II, France, May 1972.
- Prolog , manuel de r~fdrence et d'utilisalion, Groupe Intelligence Artificielle, Faculta des Sciences de Luminy, Universit6 Aix-Marseille II , France , September 1975 . Prolog, manuel de r~fdrence et d'utilisalion, Groupe Intelligence Artificielle, Faculta des Sciences de Luminy, Universit6 Aix-Marseille II, France, September 1975.
- TAUM 71 , Annual report , Projet de Traduction Automatique de l'Universit6 de Montrd.al , January 1971 . TAUM 71, Annual report, Projet de Traduction Automatique de l'Universit6 de Montrd.al, January 1971.
- Warren David H. D.,Warplan , A System .for Ge.neraling Plans, research report , University of Edimburgh , Department of Computational Logic, memo 76, June 1974 . Warren David H. D.,Warplan, A System .for Ge.neraling Plans, research report, University of Edimburgh, Department of Computational Logic, memo 76, June 1974.
Cited by
Sorted by citations
Items 101–109 of 109
Extending Prolog for Quantified Boolean Horn FormulasPreprint
Mallick, A., & Shukla, A. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.01046
A Note on Exhaustive State Space Search for Efficient Code GenerationPreprint
Bik, A. J. C. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.00564
Prolog models of classical approaches to MT
SOMERS, H. L. (2003)
High-Level Constructors for Solution Searching in Or-Parallel Prolog Systems
da Silva, J. A. M. (2014) · Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT) · doi:10.34626/51mc-me97
Scoping Report: AI-Driven Wargame Replicator
Guo, R. J., Unrau, D., & Armstrong, J. (2010)
L’IA symbolique et le dépassement de la logique classique
Prade, H. M. (2024) · Revue Ouverte d Intelligence Artificielle · doi:10.5802/roia.77
A Method for Enhancing TCM Consultation System Based on RLAIF and MoE
Chen, Y., Kong, S., Xiao, Q., Ma, K., Wang, M., & Chen, J. (2025) · IEEE International Conference on Artificial Intelligence, Computer Science and Information Processing (AICSIP) · doi:10.1109/aicsip65423.2025.11427294
Implementation of Tag Representation in Prolog Virtual Machine.
Autran, G., & Li, X. (2006)
Metadata
- Authors
- Colmerauer, A., & Roussel, P.
- Affiliations
- Groupe Intelligence Artificielle, Faculte´ des Sciences de Luminy, France
- Venue
- The second ACM SIGPLAN conference on History of programming languages
- Publisher
- ACM
- Published
- 1993-03
- Pages
- 37-52
- OpenAlex
- W1969456304
- Cited by
- 108
- References
- 22
- Citations by year
- 2025: 3 · 2024: 1 · 2022: 1 · 2021: 10 · 2020: 1 · 2019: 4 · 2018: 4 · 2017: 2 · 2015: 6 · 2014: 5 · 2013: 5 · 2012: 6
- FWCI
- 2.84
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- ACM SIGPLAN conference on History of Programming Languages (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Software › Logic, programming, and type systems
- Physical Sciences › Computer Science › Computer Science Applications › History of Computing Technologies
- Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
- Keywords
- Prolog, history of programming languages, natural language processing, French language processing, Q-system, logic programming, programming language design
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
