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
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
Handbook of Constraint Programming
Rossi, F., van Beek, P., & Walsh, T. (2006) · Foundations of artificial intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,845
Magrabi, F., Ammenwerth, E., McNair, J. B., De Keizer, N. F., Hyppönen, H., Nykänen, P., Rigby, M., Scott, P. J., Vehko, T., Wong, Z. S.-Y., et al. (2019) · Yearbook of Medical Informatics · doi:10.1055/s-0039-1677903 · Cited by 347
Concepts, Techniques, and Models of Computer Programming
Roy, P. V., & Haridi, S. (2004) · Cited by 350
Practical Foundations for Programming Languages
Harper, R. W. (2012) · Cambridge University Press eBooks · doi:10.1017/cbo9781139342131 · Cited by 188
Costa, V. S., Rocha, R., & Damas, L. (2011) · Theory and Practice of Logic Programming · doi:10.1017/s1471068411000512 · Cited by 149
Constraint Satisfaction: An Emerging Paradigm
Freuder, E. C., & Mackworth, A. K. (2006) · Foundations of artificial intelligence · doi:10.1016/s1574-6526(06)80006-4 · Cited by 106
Formalising Traffic Rules for Accountability of Autonomous Vehicles
Rizaldi, A., & Althoff, M. (2015) · IEEE International Conference on Intelligent Transportation Systems (ITSC) · doi:10.1109/itsc.2015.269 · Cited by 93
Inductive Logic Programming At 30: A New Introduction
Cropper, A., & Dumančić, S. (2022) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.13507 · Cited by 83
“Prolog (Kowalski, 1988; Colmerauer & Roussel, 1993) is a logic programming language based on SLD-resolution.”
Background1983–1993: The wonder years of sequential Prolog implementation
Roy, P. V. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90031-0 · Cited by 74
CLP(QS): A Declarative Spatial Reasoning Framework
Bhatt, M., Lee, J. H., & Schultz, C. P. L. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23196-4_12 · Cited by 67
Formalizing the structural semantics of domain-specific modeling languages
Jackson, E. K., & Sztipanovits, J. (2008) · Software & Systems Modeling · doi:10.1007/s10270-008-0105-0 · Cited by 67
Model-based runtime analysis of distributed reactive systems
Bauer, A., Leucker, M., & Schallhart, C. (2006) · Australasian Software Engineering Conference (ASWEC) · doi:10.1109/aswec.2006.36 · Cited by 69
Head-Driven Phrase Structure Grammar
Levine, R. D., & Meurers, D. (2006) · Elsevier eBooks · doi:10.1016/b0-08-044854-2/02040-x · Cited by 60
Burton, A. H., Kowalski, R., Gacic-Dobo, M., Karimov, R., & Brown, D. W. (2012) · PLoS ONE · doi:10.1371/journal.pone.0047806 · Cited by 59
Catala: a programming language for the law
Merigoux, D., Chataing, N., & Protzenko, J. (2021) · Proceedings of the ACM on Programming Languages · doi:10.1145/3473582 · Cited by 56
da Silva, V. T. (2008) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-008-9039-8 · Cited by 48
Language Issues for Cognitive Radio
Kokar, M. M., & Lechowicz, L. (2009) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2013028 · Cited by 40
Visualization for constructing and sharing geo-scientific concepts
MacEachren, A. M., GAHEGAN, M. N., & Pike, W. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307755101 · Cited by 37
Packrat parsers can handle practical grammars in mostly constant space
Mizushima, K., Maeda, A., & Yamaguchi, Y. (2010) · ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE) · doi:10.1145/1806672.1806679 · Cited by 28
Improved Compilation of Prolog to C Using Moded Types and Determinism Information
Morales, J. F., Carro, M., & Hermenegildo, M. V. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24836-1_7 · Cited by 28
Levine, R. D., & Meurers, D. (2006) · Cited by 25
High Level Structures for Quantum Computing
Miszczak, J. A. (2012) · Synthesis lectures on quantum computing · doi:10.1007/978-3-031-02516-7 · Cited by 26
Evolving networks: Eras and turning points
Berlingerio, M., Coscia, M., Giannotti, F., Monreale, A., & Pedreschi, D. (2013) · Intelligent Data Analysis · doi:10.3233/ida-120566 · Cited by 22
The architecture and design of a malleable object-oriented prolog engine
Piancastelli, G., Benini, A., Omicini, A., & Ricci, A. (2008) · ACM Symposium on Applied Computing · doi:10.1145/1363686.1363739 · Cited by 17
REA2: A unified formalisation of the Resource-Event-Agent ontology
Laurier, W., Kiehn, J., & Polovina, S. M. (2018) · Applied Ontology · doi:10.3233/ao-180198 · Cited by 16
2P-Kt: A logic-based ecosystem for symbolic AI
Ciatto, G., Calegari, R., & Omicini, A. (2021) · SoftwareX · doi:10.1016/j.softx.2021.100817 · Cited by 18
A Historical Perspective on Artificial Intelligence in Applied Life Sciences
Emara, T. Z., Hassan, E., Elbedwehy, S., & Saber, A. (2025) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3693-9208-9.ch002 · Cited by 13
Lindsey, C. H. (1993) · ACM SIGPLAN conference on History of Programming Languages · doi:10.1145/154766.155365 · Cited by 12
RIO : Roles, Interactions and Organizations
Mathieu, P., Routier, J.-C., & Secq, Y. (2007) · Springer eBooks · doi:10.1007/3-540-45023-8_15 · Cited by 13
Krall, A. (1996) · The Journal of Logic Programming · doi:10.1016/s0743-1066(96)00064-7 · Cited by 12
Survey of Knowledge Representation and Reasoning Systems
Trentelman, K. (2009) · Cited by 11
The Design of the YAP Compiler: An Optimizing Compiler for Logic Programming Languages
da Silva, A. F., & Costa, V. S. (2020) · doi:10.3217/jucs-012-07-0764 · Cited by 10
Languages and systems for RDF stream processing, a survey
Bonte, P., Callé, C., Curé, O. C., Kondylakis, H., & Tommasini, R. (2025) · The VLDB Journal · doi:10.1007/s00778-025-00927-7 · Cited by 9
A Virtual Classroom for Cybersecurity Education
Haag, J., Vranken, H., & van Eekelen, M. (2019) · Lecture notes in computer science · doi:10.1007/978-3-662-59351-6_13 · Cited by 9
A Survey of the Proof-Theoretic Foundations of Logic Programming
Miller, D. (2021) · Theory and Practice of Logic Programming · doi:10.1017/s1471068421000533 · Cited by 14
SolverBlox: algebraic modeling in datalog
Borraz-Sánchez, C., Klabjan, D., Pasalic, E., & Aref, M. (2018) · ACM eBooks · doi:10.1145/3191315.3191322 · Cited by 8
Neto, R. D. F. B. (2006) · doi:10.11606/t.55.2006.tde-01032007-163908 · Cited by 8
SensBution: A Rule-Based Peer-to-Peer Approach for Sensor-Based Infrastructures
Gross, T., Paul-Stueve, T., & Palakarska, T. (2007) · Euromicro Conference on Software Engineering and Advanced Applications (SEAA) · doi:10.1109/euromicro.2007.54 · Cited by 8
Web Sites Repairing through Abduction
Mancarella, P. M., Terreni, G., & Toni, F. (2009) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2009.03.009 · Cited by 7
Lindsey, C. H. (1996) · ACM eBooks · doi:10.1145/234286.1057810 · Cited by 7
Lazy Stream Manipulation in Prolog via Backtracking: The Case of 2P-Kt
Ciatto, G., Calegari, R., & Omicini, A. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-75775-5_27 · Cited by 6
Text-mining in Terms of Methodology and Development
Isaeva, E., & Aldarova, D. (2021) · IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering · doi:10.1109/elconrus51938.2021.9396437 · Cited by 5
Rule-Based Composition Behaviors in Dynamic Plug-In Systems
Jahn, M., Löberbauer, M., Wölfinger, R., & Mössenböck, H. (2010) · Asia-Pacific Software Engineering Conference (APSEC) · doi:10.1109/apsec.2010.19 · Cited by 5
The YAP Prolog SystemPreprint
Costa, V. S., Damas, L., & Rocha, R. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1102.3896 · Cited by 5
History of Constraint Programming
Barták, R. (2011) · Wiley Encyclopedia of Operations Research and Management Science · doi:10.1002/9780470400531.eorms0382 · Cited by 4
SLASH: Embracing Probabilistic Circuits into Neural Answer Set ProgrammingPreprint
Skryagin, A., Stammer, W., Ochs, D., Dhami, D. S., & Kersting, K. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.03395 · Cited by 11
Reliable Reasoning Beyond Natural Language
Borazjanizadeh, N., & Piantadosi, S. T. (2024) · arXiv · doi:10.48550/arxiv.2407.11373 · Cited by 3
“Formalizing of reasoning in a system other than natural language has several descendants, from the General Problem Solver of Newell et al. [22], to logic programming languages like Prolog [12], and formal tools for robust verification like Lean [21].”
Design and Implementation of a Multithreaded Virtual Machine for Executing Linear Logic Programs
Cruz, F., Rocha, R., & Goldstein, S. C. (2014) · International Symposium on Principles and Practice of Declarative Programming (PPDP) · doi:10.1145/2643135.2643150 · Cited by 3
Optimized Quantum Circuit Generation with SPIRAL
Mionis, S., Franchetti, F., & Larkin, J. M. (2021) · IEEE High Performance Extreme Computing Conference · doi:10.1109/hpec49654.2021.9622814 · Cited by 2
A quantitative model for software engineering trends
Rabai, L. B. A., Bai, Y. Z., & Mili, A. (2011) · Information Sciences · doi:10.1016/j.ins.2011.07.004 · Cited by 3
Lu, B., & Liu, Z. (2013) · Chinese Control and Decision Conference (CCDC) · doi:10.1109/ccdc.2013.6561054 · Cited by 3
Lin, Y.-C. H. (2011) · IGI Global eBooks · doi:10.4018/978-1-60960-037-2.ch020 · Cited by 3
SENSID: a Sensor Network Situation Detector
Kranz, M. (2013) · Cited by 3
Hardware execution of constraint handling rules
Triossi, A. (2012) · ARCA (Università Ca' Foscari Venezia) · Cited by 3
Axiomatic specification and logic programming: fast prototyping of correct designs
Boriani, D. V. (1995) · ISA Transactions · doi:10.1016/0019-0578(94)00050-v · Cited by 3
Aspects of Prolog history: Logic Programming and Professional Dynamics
Rouchy, P. (2015) · doi:10.13140/rg.2.1.3986.1929 · Cited by 3
An Exercise Assistant for Practical Networking Courses
Haag, J., Witte, C., Karsch, S., Vranken, H., & van Eekelen, M. (2014) · International Conference on Computer Supported Education · doi:10.5220/0004843700970104 · Cited by 2
Approche bayésienne de la composition sémantique dans les systèmes de dialogue oral
Meurs, M., Lefèvre, F., & Mori, R. D. (2010) · Ingénierie des systèmes d information · doi:10.3166/isi.15.2.49-71 · Cited by 2
A practical guide to assuring the system resilience to operational errors
Zonnenshain, A., & Harel, A. (2015) · INCOSE International Symposium · doi:10.1002/j.2334-5837.2015.00080.x · Cited by 2
Reciprocal Influences Between Proof Theory and Logic Programming
Miller, D. (2019) · Philosophy & Technology · doi:10.1007/s13347-019-00370-x · Cited by 2
A Bayesian approach to semantic composition for spoken language interpretation
Meurs, M., Lefèvre, F., & Mori, R. D. (2008) · Interspeech (USB) · doi:10.21437/interspeech.2008-352 · Cited by 2
Automatic JIT Compiler Generation with Runtime Partial Evaluation
Bolz, C. F., Aurich, V., & Leuschel, M. (2008) · Cited by 2
On the definition of non-player character behaviour for real-time simulated virtual environments
Anderson, E. F. (2008) · Bournemouth University Research Online (Bournemouth University) · Cited by 2
Critical factors in the evolution of logic programming and Prolog
Darby-Dowman, K., & Little, J. (1997) · European Journal of Information Systems · doi:10.1038/sj.ejis.3000255 · Cited by 2
Search in concurrent logic languages
Huntbach, M. M. (1995) · ACM Symposium on Applied Computing · doi:10.1145/315891.315947 · Cited by 2
Modélisation du comportement humain dans les simulations de combat naval
Toulgoat, I. (2011) · doi:10.70675/e30888e1za10cz4e58z9812z4826cb8de462 · Cited by 2
Open Prolog: a Structure-Sharing Prolog for the Macintosh
Brady, M. (2005) · Trinity's Access to Research Output (TARA) (Trinity College Dublin) · Cited by 2
Declarative Constraint Programming
Fernández, A. J. (2006) · INTELIGENCIA ARTIFICIAL · doi:10.4114/ia.v9i27.853 · Cited by 1
Stefanović, D. (2009) · Nature Nanotechnology · doi:10.1038/nnano.2009.284 · Cited by 1
Automated Reasoning Embedded in Question Answering
Pelzer, B. (2013) · Cited by 1
An adaptive prolog programming language with machine learning
Lu, B., Liu, Z., & Gao, H. (2012) · IEEE International Conference on Cloud Computing and Intelligence Systems (CCIS) · doi:10.1109/ccis.2012.6664359 · Cited by 1
Articulating Human Systems Integration
Boy, G. A. (2021) · Human-computer interaction series · doi:10.1007/978-3-030-76391-6_4 · Cited by 1
Seifert, S., Zillner, S., Huber, M., Sintek, M., Sonntag, D., & Cavallaro, A. (2011) · Springer eBooks · doi:10.1007/978-3-642-21507-0_9 · Cited by 1
A Model-Based Framework for Building Self-Adaptive Distributed Software
Aissaoui, O., Amirat, A., & Atil, F. (2014) · Informatica · Cited by 1
An Exercise Assistant for Practical Networking and IT Security Courses in Higher Education
Haag, J., Karsch, S., Vranken, H., & van Eekelen, M. (2015) · Communications in computer and information science · doi:10.1007/978-3-319-25768-6_6 · Cited by 1
Trusted Collaboration in Distributed Software Development
Watkins, E. R. (2007) · ePrints Soton (University of Southampton) · Cited by 1
Constraint Generation and Reasoning in OWL
Briggs, T. H. (2008) · doi:10.13016/m2k95x · Cited by 1
Inference and Learning for Directed Probabilistic Logic Models
Meert, W. (2011) · Lirias (KU Leuven) · Cited by 1
SLDR-DL: A Framework for SLD-Resolution with Deep LearningPreprint
Cai, C. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.02210 · Cited by 1
Improving the compilation of prolog to C using type and determinism information: Preliminary results
Caballero, J. F. M., Liñares, M. C., & Hermenegildo, M. V. (2003) · Cited by 1
Lindsey, C. H. (1993) · ACM SIGPLAN Notices · doi:10.1145/155360.155365 · Cited by 1
Relations in Role-Based Data Modeling and Navigation
Harkes, D. C. (2014) · Research Repository (Delft University of Technology)
Improving Compilation of Prolog to C Using Program Information?
Morales, J. F., & Carro, M. (2015)
Automating the TANDEM Design Method in End-User Programming Environments
Goschnick, S. (2012) · International Journal of People-Oriented Programming · doi:10.4018/ijpop.2012010102
Die Evolution der Programmiersprachen der KI
Hofstedt, P. (2011) · Künstliche Intell. · doi:10.1007/s13218-011-0157-0
Técnicas avanzadas de compilación para programación lógica
Caballero, J. F. M. (2010) · Dialnet (Universidad de la Rioja)
Operator-Based Semantics for Logic Programs
Hitzler, P. (2004) · Journal of Bioresource Management
Seminar on the History of Programming Languages
Taherkhani, A. (2009)
Backdoors to Tractability of Answer-Set Programming
Fichte, J. K. (2013) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v27i1.8505
The simple and powerful yfx operator precedence parser
Favero, E. L. (2007) · Software Practice and Experience · doi:10.1002/spe.811
Un Esquema de Programaci on L ogico Funcional Concurrente con Restricciones
Garc, M. M., Rold, R. C., & de Inform, F. (2011)
Concepts of Programming Languages: A Unified Approach
Abrahamson, K. (2011)
Jouis, C., Bourdaillet, J., Habib, B., & Ganascia, J. (2010) · IGI Global eBooks · doi:10.4018/978-1-61520-859-3.ch003
Composition non modulaire modulaire
Douence, R. (2015) · HAL
Lecture Notes on Constructive Logic: Overview
Pfenning, F. (2009)
Logic and Proof in Computer Science
Coffey, J. W. (2017) · Advances in knowledge acquisition, transfer, and management book series/Advances in knowledge acquisition, transfer and management book series · doi:10.4018/978-1-5225-2443-4.ch007
A Design Method for People-Oriented Programming
Goschnick, S. (2018) · Advances in computer and electrical engineering book series · doi:10.4018/978-1-5225-5969-6.ch006
PathQuery Pregel: high-performance graph query with bulk synchronous processing
Arsintescu, B. G., Deo, S., & Harris, W. (2019) · Pattern Analysis and Applications · doi:10.1007/s10044-019-00841-z
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
