Fifty Years of Prolog and Beyond

KÖRNER, PHILIPP; LEUSCHEL, MICHAEL; BARBOSA, JOÃO; COSTA, VÍTOR SANTOS; DAHL, VERÓNICA; HERMENEGILDO, MANUEL V.; MORALES, JOSE F.; WIELEMAKER, JAN; DIAZ, DANIEL; ABREU, SALVADOR; CIATTO, GIOVANNI

doi:10.1017/s1471068422000102

Cited by 41Logic, programming, and type systemsLogic, Reasoning, and KnowledgeTeaching and Learning Programming

Fifty Years of Prolog and Beyond

Open access

KÖRNER, PHILIPP, LEUSCHEL, MICHAEL, BARBOSA, JOÃO, COSTA, VÍTOR SANTOS, DAHL, VERÓNICA, HERMENEGILDO, MANUEL V., MORALES, JOSE F., WIELEMAKER, JAN +3 more·2022·Theory and Practice of Logic Programming

DOI 10.1017/s1471068422000102

Open this paper in CoChat — free account

Abstract

Both logic programming in general and Prolog in particular have a long and fascinating history, intermingled with that of many disciplines they inherited from or catalyzed. A large body of research has been gathered over the last 50 years, supported by many Prolog implementations. Many implementations are still actively developed, while new ones keep appearing. Often, the features added by different systems were motivated by the interdisciplinary needs of programmers and implementors, yielding systems that, while sharing the “classic” core language, in particular, the main aspects of the ISO-Prolog standard, also depart from each other in other aspects. This obviously poses challenges for code portability. The field has also inspired many related, but quite different languages that have created their own communities. This article aims at integrating and applying the main lessons learned in the process of evolution of Prolog. It is structured into three major parts. First, we overview the evolution of Prolog systems and the community approximately up to the ISO standard, considering both the main historic developments and the motivations behind several Prolog implementations, as well as other logic programming languages influenced by Prolog. Then, we discuss the Prolog implementations that are most active after the appearance of the standard: their visions, goals, commonalities, and incompatibilities. Finally, we perform a SWOT analysis in order to better identify the potential of Prolog and propose future directions along with which Prolog might continue to add useful features, interfaces, libraries, and tools, while at the same time improving compatibility between implementations.

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

Crossref · 10.1017/s1471068422000102

Cites

298 of 298 references verified0 citation errors · 0 not checkable

Statistics

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?

In ILP, Prolog offers a deductive engine that serves as a natural verifier: by executing candidate predicates on subsets of examples, it precisely reveals whether an invented predicate generalizes as intended.
“In the context of ILP, Prolog [12], the predominant logic programming language used in ILP, offers a deductive engine that serves as a natural verifier: by executing candidate predicates on subsets of examples, it precisely reveals whether an invented predicate generalizes as intended.”
From ADVENT: LLM-Driven Automatic Predicate Invention for ILP (2026) · cites this paper as [12]
The Artificial Intelligence section (p. 52) says Prolog is typically used in ILP to represent background knowledge, examples, and induced theories. Section 2.1 (p. 5) describes Prolog’s resolution-based execution of queries. Neither passage says that executing candidate predicates on subsets of examples verifies whether an invented predicate generalizes as intended. (LLM, conf=0.84)
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.

Lecture Notes in Computer Science 1205
(1999) · Industrial Robot the international journal of robotics research and application · doi:10.1108/ir.1999.04926fae.001 · Cited by 39,228 · see citing works
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints
Cousot, P., & Cousot, R. (1977) · Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '77 · doi:10.1145/512950.512973 · Cited by 6,279 · see citing works
The mythos of model interpretability
Lipton, Z. C. (2018) · Communications of the ACM · doi:10.1145/3233231 · Cited by 5,427 · see citing works
Cultivating Communities of Practice: A Guide to Managing Knowledge
Cuddy, C. (2002) · The Bottom Line Managing Library Finances · doi:10.1108/bl.2002.17015bae.001 · Cited by 3,935 · see citing works
A Machine-Oriented Logic Based on the Resolution Principle
Robinson, J. A. (1965) · Journal of the ACM · doi:10.1145/321250.321253 · Cited by 3,916 · see citing works
Algorithms of Oppression: How Search Engines Reinforce Racism
Noble, S. U. (2020) · doi:10.2307/j.ctt1pwt9w5 · Cited by 2,709 · see citing works
GPT-3: Its Nature, Scope, Limits, and Consequences
Floridi, L., & Chiriatti, M. (2020) · Minds and Machines · doi:10.1007/s11023-020-09548-1 · Cited by 2,519 · see citing works
Negation as Failure
Clark, K. (1978) · Springer eBooks · doi:10.1007/978-1-4684-3384-5_11 · Cited by 2,111 · see citing works
Binary Decision Diagrams
Akers (1978) · IEEE Transactions on Computers · doi:10.1109/tc.1978.1675141 · Cited by 1,831 · see citing works
An efficient context-free parsing algorithm
Earley, J. (1970) · Communications of the ACM · doi:10.1145/357980.358005 · Cited by 1,722 · see citing works
The well-founded semantics for general logic programs
Van Gelder, A., Ross, K. A., & Schlipf, J. S. (1991) · Journal of the ACM · doi:10.1145/116825.116838 · Cited by 1,652 · see citing works
Inductive Logic Programming: Theory and methods
Muggleton, S., & de Raedt, L. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90035-3 · Cited by 1,537 · see citing works
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 · see citing works
Constraint logic programming: a survey
Jaffar, J., & Maher, M. J. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90033-7 · Cited by 1,316 · see citing works
Constraint logic programming
Jaffar, J., & Lassez, J. (1987) · ACM-SIGACT Symposium on Principles of Programming Languages · doi:10.1145/41625.41635 · Cited by 1,204 · see citing works
Prolog Programming for Artificial Intelligence
Bratko, I. (1986) · Information and Software Technology · doi:10.1016/0950-5849(87)90035-8 · Cited by 1,176 · see citing works
The DLV system for knowledge representation and reasoning
Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., & Scarcello, F. (2006) · ACM Transactions on Computational Logic · doi:10.1145/1149114.1149117 · Cited by 1,152 · see citing works
On Closed World Data Bases
Reiter, R. (1978) · Springer eBooks · doi:10.1007/978-1-4684-3384-5_3 · Cited by 1,129 · see citing works
Climbing towards NLU: On Meaning, Form, and Understanding in the Age of Data
Bender, E. M., & Koller, A. (2020) · Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/2020.acl-main.463 · Cited by 1,082 · cited 2× · see citing works
“…milestones in machine translation, sentence completion, and other standard benchmarking tasks, it offers a priori no way to learn meaning (Bender and Koller 2020) and relies on undocumented, un-retraceable, or otherwise partial (and therefore unaccountable) data, which tends to…”
Background
Definite clause grammars for language analysis—A survey of the formalism and a comparison with augmented transition networks
Pereira, F. C. N., & Warren, D. H. D. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90003-x · Cited by 978 · see citing works
Answer set programming at a glance
Brewka, G., Eiter, T., & Truszczyński, M. (2011) · Communications of the ACM · doi:10.1145/2043174.2043195 · Cited by 946 · see citing works
Programming with Constraints
Marriott, K. G., & Stuckey, P. J. (1998) · The MIT Press eBooks · doi:10.7551/mitpress/5625.001.0001 · Cited by 864 · see citing works
Logic programs with stable model semantics as a constraint programming paradigm
Niemelä, I. (1999) · Annals of Mathematics and Artificial Intelligence · doi:10.1023/a:1018930122475 · Cited by 837 · see citing works
MiniZinc: Towards a Standard CP Modelling Language
Nethercote, N., Stuckey, P. J., Becket, R., Brand, S., Duck, G. J., & Tack, G. (2007) · Springer eBooks · doi:10.1007/978-3-540-74970-7_38 · Cited by 783 · see citing works
Stable Models and an Alternative Logic Programming Paradigm
Marek, V. W., & Truszczyński, M. (1999) · Artificial intelligence · doi:10.1007/978-3-642-60085-2_17 · Cited by 745 · see citing works
Logic and Databases: A Deductive Approach
Gallaire, H., Minker, J., & Nicolas, J.-M. (1984) · ACM Computing Surveys · doi:10.1145/356924.356929 · Cited by 734 · see citing works
Algorithmic injustice: A relational ethics approach
Birhane, A. (2021) · Patterns · doi:10.1016/j.patter.2021.100205 · Cited by 707 · cited 2× · see citing works
“…sentence completion, and other standard benchmarking tasks, it offers a priori no way to learn meaning (Bender and Koller 2020) and relies on undocumented, un-retraceable, or otherwise partial (and therefore unaccountable) data, which tends to perpetuate harm without recourse (Birhane 2021).”
Background
ProbLog: A probabilistic Prolog and its application in link discovery
Raedt, L. D., Kimmig, A., & Toivonen, H. T. T. (2006) · Lirias · Cited by 698 · see citing works
Predicate Logic as Programming Language.
Kowalski, R. (1974) · IFIP Congress · Cited by 670 · see citing works
A Survey of Methods for Explaining Black Box Models
Guidotti, R., Monreale, A., Ruggieri, S., Turini, F., Giannotti, F., & Pedreschi, D. (2019) · ACM Computing Surveys · doi:10.1145/3236009 · Cited by 629 · see citing works
Algorithm = logic + control
Kowalski, R. (1979) · Communications of the ACM · doi:10.1145/359131.359136 · Cited by 613 · see citing works
Probabilistic Horn abduction and Bayesian networks
Poole, D. (1993) · Artificial Intelligence · doi:10.1016/0004-3702(93)90061-f · Cited by 581 · see citing works
LISP 1.5 PROGRAMMER'S MANUAL
McCarthy, J., Abrahams, P. W., Edwards, D. J., Hart, T. P., & Levin, M. I. (1962) · doi:10.21236/ad0406138 · Cited by 555 · see citing works
Explainable Artificial Intelligence (XAI)
Hossain, M. (2021) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.6371435 · Cited by 544 · see citing works
Artificial intelligence and algorithmic bias: implications for health systems
Panch, T., Mattie, H., & Atun, R. (2019) · Journal of Global Health · doi:10.7189/jogh.09.020318 · Cited by 533 · see citing works
The Art of Prolog: Advanced Programming Techniques
STERLING, L. S., & Shapiro, E. Y. (1994) · Cited by 532 · see citing works
The CLP( ℛ ) language and system
Jaffar, J., Michaylov, S., Stuckey, P. J., & Yap, R. H. C. (1992) · ACM Transactions on Programming Languages and Systems · doi:10.1145/129393.129398 · Cited by 522 · see citing works
The Constraint Logic Programming Language CHIP.
Dincbas, M., Hentenryck, P. V., Simonis, H., Aggoun, A., Graf, T., & Berthier, F. (1988) · Future Generation Computer Systems · Cited by 508 · see citing works
A Statistical Learning Method for Logic Programs with Distribution Semantics
Sato, T. (1995) · The MIT Press eBooks · doi:10.7551/mitpress/4298.003.0069 · Cited by 415 · see citing works
ProB: an automated analysis toolset for the B method
Leuschel, M., & Butler, M. J. (2008) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s10009-007-0063-9 · Cited by 390 · see citing works
Self-citation
SWI-Prolog
Wielemaker, J., Schrijvers, T., Triska, M., & Lager, T. (2011) · Theory and Practice of Logic Programming · doi:10.1017/s1471068411000494 · Cited by 387 · see citing works
Self-citation
OLD resolution with tabulation
Tamaki, H., & Sato, T. (1986) · Lecture notes in computer science · doi:10.1007/3-540-16492-8_66 · Cited by 376 · see citing works
Nondeterministic Algorithms
Floyd, R. W. (1967) · Journal of the ACM · doi:10.1145/321420.321422 · Cited by 369 · see citing works
Prolog and natural language analysis . By Fernando C.N. Pereira and Stuart M. Shieber (CSLI Lecture Notes 10.) Stanford: Center for the Study of Language and Information, 1987. Pp. viii, 266.
Harrison, S. P. (1988) · Language · doi:10.2307/414538 · Cited by 364 · see citing works
Guarded horn clauses
Ueda, K. (1986) · Lecture notes in computer science · doi:10.1007/3-540-16479-0_17 · Cited by 342 · see citing works
The execution algorithm of mercury, an efficient purely declarative logic programming language
Somogyi, Z., Henderson, F., & Conway, T. (1996) · The Journal of Logic Programming · doi:10.1016/s0743-1066(96)00068-4 · Cited by 324 · see citing works
PARLOG: parallel programming in logic
Clark, K., & Gregory, S. (1986) · ACM Transactions on Programming Languages and Systems · doi:10.1145/5001.5390 · Cited by 324 · see citing works
Introducing global constraints in CHIP
Beldiceanu, N., & Contejean, É. (1994) · Mathematical and Computer Modelling · doi:10.1016/0895-7177(94)90127-9 · Cited by 315 · see citing works
Application of Theorem Proving to Problem Solving
Green, C. (1969) · doi:10.21236/ada459656 · Cited by 290 · see citing works
An efficient easily adaptable system for interpreting natural language queries
Warren, D. H. D., & Pereira, F. C. N. (1982) · doi:10.5555/972942.972944 · Cited by 281 · see citing works
SATCHMO: A theorem prover implemented in Prolog
Manthey, R., & Bry, F. (2005) · Springer eBooks · doi:10.1007/bfb0012847 · Cited by 280 · see citing works
The Aurora or-parallel Prolog system
Lusk, E. L., Butler, R. M., Disz, T., Olson, R., Overbeek, R., Stevens, R. L., Warren, D. H. D., Calderwood, A., Szeredi, P., Haridi, S., et al. (1990) · New Generation Computing · doi:10.1007/bf03037208 · Cited by 268 · see citing works
Linear resolution with selection function
Kowalski, R., & Kuehner, D. (1971) · Artificial Intelligence · doi:10.1016/0004-3702(71)90012-9 · Cited by 259 · see citing works
A polymorphic type system for prolog
Mycroft, A., & O’Keefe, R. A. (1984) · Artificial Intelligence · doi:10.1016/0004-3702(84)90017-1 · Cited by 256 · see citing works
From tuple spaces to tuple centres
Omicini, A., & Denti, E. (2001) · Science of Computer Programming · doi:10.1016/s0167-6423(01)00011-9 · Cited by 253 · see citing works
Logic Programs with Annotated Disjunctions
Vennekens, J., Verbaeten, S., & Bruynooghe, M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27775-0_30 · Cited by 236 · see citing works
Warren's Abstract Machine
Aı̈t-Kaci, H. (1991) · The MIT Press eBooks · doi:10.7551/mitpress/7160.001.0001 · Cited by 231 · see citing works
PLANNER: a language for proving theorems in robots
Hewitt, C. E. (1969) · International Joint Conference on Artificial Intelligence · Cited by 210 · see citing works
PRISM: a language for symbolic-statistical modeling
Sato, T., & Kameya, Y. (1997) · Cited by 204 · see citing works
Compiling constraints in clp(FD)
Codognet, P., & Díaz, D. (1996) · The Journal of Logic Programming · doi:10.1016/0743-1066(95)00121-2 · Cited by 198 · see citing works
XSB: Extending Prolog with Tabled Logic Programming
Swift, T., & Warren, D. S. (2011) · Theory and Practice of Logic Programming · doi:10.1017/s1471068411000500 · Cited by 196 · see citing works
Using Datalog with Binary Decision Diagrams for Program Analysis
Whaley, J., Avots, D., Carbin, M., & Lam, M. S. (2005) · Lecture notes in computer science · doi:10.1007/11575467_8 · Cited by 191 · see citing works
Concurrent PROLOG: Collected Papers
Shapiro, E. Y. (1987) · Cited by 187 · see citing works
Equations and Inequations on Finite and Infinite Trees.
Colmerauer, A. (1984) · Future Generation Computer Systems · Cited by 182 · see citing works
Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
Hermenegildo, M. V., Puebla, G., Bueno, F., & López-García, P. (2005) · Science of Computer Programming · doi:10.1016/j.scico.2005.02.006 · Cited by 181 · see citing works
Self-citation
Declarative information extraction using datalog with embedded extraction predicates
Shen, W., Doan, A., Naughton, J. F., & Ramakrishnan, R. (2007) · Cited by 180 · see citing works
The early years of logic programming
Kowalski, R. A. (1988) · Communications of the ACM · doi:10.1145/35043.35046 · Cited by 176 · see citing works
Logic Semantics for a Class of Committed-Choice Programs.
Maher, M. J. (1987) · Cited by 170 · see citing works
Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem**This research was sponsored by the Defense Advanced Research Projects Agency (DOD). ARPA Order No. 3597, monitored by the Air Force Avionics Laboratory under Contract F33615-78-C-1551.The views and conclusions contained in this document are those of the author and should not be interpreted as representing the official policies, either expressed or implied, of the Defense Advanced Research Projects Agency or the US Government.
Forgy, C. L. (1989) · Elsevier eBooks · doi:10.1016/b978-0-934613-53-8.50041-8 · Cited by 170 · see citing works
Question analysis: How Watson reads a clue
Lally, A., Prager, J. M., McCord, M. C., Boguraev, B. K., Patwardhan, S., Fan, J., Fodor, P., & Chu‐Carroll, J. (2012) · IBM Journal of Research and Development · doi:10.1147/jrd.2012.2184637 · Cited by 167 · see citing works
Action Languages, Answer Sets, and Planning
Lifschitz, V. (1999) · The Logic Programming Paradigm · doi:10.1007/978-3-642-60085-2_16 · Cited by 163 · see citing works
The birth of Prolog
Colmerauer, A., & Roussel, P. (1996) · ACM eBooks · doi:10.1145/234286.1057820 · Cited by 160 · see citing works
Parallel execution of prolog programs
Gupta, G., Pontelli, E., Ali, K. A. M., Carlsson, M., & Hermenegildo, M. V. (2001) · ACM Transactions on Programming Languages and Systems · doi:10.1145/504083.504085 · Cited by 155 · see citing works
Self-citation
An overview of Ciao and its design philosophy
Hermenegildo, M. V., Bueno, F., Carro, M., López-García, P., Mera, E., Morales, J. F., & Puebla, G. (2011) · Theory and Practice of Logic Programming · doi:10.1017/s1471068411000457 · Cited by 152 · see citing works
Self-citation
Graph Neural Networks Meet Neural-Symbolic Computing: A Survey and Perspective
Lamb, L. C., Garcez, A. D., Gori, M., Prates, M., Avelar, P., & Vardi, M. Y. (2020) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2020/679 · Cited by 151 · see citing works
The YAP Prolog system
Costa, V. S., Rocha, R., & Damas, L. (2011) · Theory and Practice of Logic Programming · doi:10.1017/s1471068411000512 · Cited by 149 · see citing works
Self-citation
Programming with Higher-Order Logic
Miller, D., & Nadathur, G. (2012) · Cambridge University Press eBooks · doi:10.1017/cbo9781139021326 · Cited by 149 · see citing works
The Connectionist Inductive Learning and Logic Programming System
Garcez, A. S. A., & Zaverucha, G. (1999) · Applied Intelligence · doi:10.1023/a:1008328630915 · Cited by 147 · see citing works
leanTAP: Lean tableau-based deduction
Beckert, B., & Posegga, J. (1995) · Journal of Automated Reasoning · doi:10.1007/bf00881804 · Cited by 147 · see citing works
A history of Erlang
Armstrong, J. (2007) · doi:10.1145/1238844.1238850 · Cited by 145 · see citing works
Soufflé: On Synthesis of Program Analyzers
Jordan, H., Scholz, B., & Subotić, P. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-41540-6_23 · Cited by 138 · see citing works
Functional logic programming
Antoy, S., & Hanus, M. (2010) · Communications of the ACM · doi:10.1145/1721654.1721675 · Cited by 136 · see citing works
The Java Virtual Machine Specification, Java SE 8 Edition
Lindholm, T., Yellin, F., Bracha, G., & Buckley, A. (2013) · Cited by 130 · see citing works
The Smodels System
Syrjanen, T., & Niemelä, I. (2001) · International Conference on Logic Programming and Non-Monotonic Reasoning · doi:10.1007/3-540-45402-0_38 · Cited by 130 · see citing works
XSB: A system for efficiently computing well-founded semantics
Rao, P., Sagonas, K., Swift, T., Warren, D. S., & Freire, J. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63255-7_33 · Cited by 125 · see citing works
Modularity in Logic Programming
Michele Bugliesi, A., Lamma, E., & Mello, P. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90032-9 · Cited by 120 · see citing works
Datalog and emerging applications
Huang, S., Green, T. J., & Loo, B. T. (2011) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/1989323.1989456 · Cited by 117 · see citing works
From Statistical Relational to Neuro-Symbolic Artificial Intelligence
Raedt, L. D., Dumančić, S., Manhaeve, R., & Marra, G. (2020) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2020/688 · Cited by 117 · see citing works
Programming paradigms of the Andorra Kernel Language
Janson, S., & Haridi, S. (1991) · Cited by 117 · see citing works
Logic-based technologies for multi-agent systems: a systematic literature review
Calegari, R., Ciatto, G., Mascardi, V., & Omicini, A. (2021) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-020-09478-3 · Cited by 117 · cited 1× · see citing works
“This is, for instance, what happened with the Multi-Agent System community, where Prolog and LP have been extensively exploited in the last decades as the technological or conceptual basis for tens of agent-oriented technologies (Calegari et al., 2021).”
BackgroundSelf-citation
Argumentative XAI: A Survey
Čyras, K., Rago, A., Albini, E., Baroni, P., & Toni, F. (2021) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2021/600 · Cited by 116 · see citing works
High-performance logic programming with the Aquarius Prolog compiler
Roy, P. V., & Despain, A. M. (1992) · Computer · doi:10.1109/2.108055 · Cited by 115 · see citing works
Fast relational learning using bottom clause propositionalization with artificial neural networks
França, M. V. M., Zaverucha, G., & Garcez, A. D. (2013) · Machine Learning · doi:10.1007/s10994-013-5392-1 · Cited by 114 · see citing works
Constraint Handling Rules
Frühwirth, T. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511609886 · Cited by 113 · see citing works
An abstract machine for restricted AND-parallel execution of logic programs
Hermenegildo, M. V. (1986) · Lecture notes in computer science · doi:10.1007/3-540-16492-8_62 · Cited by 112 · see citing works
Self-citation
Coinductive Logic Programming
Simon, L., Mallya, A., Bansal, A. K., & Gupta, G. (2006) · International Conference on Logic Programming · doi:10.1007/11799573_25 · Cited by 111 · see citing works
A Survey of Research in Deductive Database Systems
Ramakrishnan, R., & Ullman, J. R. D. (1995) · Cited by 111 · see citing works
Contextual Logic Programming.
Monteiro, L., & Porto, A. (1989) · Cited by 107 · see citing works
On the practicality of global flow analysis of logic programs
Warren, R., Hermenegildo, M. V., & Debray, S. (1988) · Hispana · Cited by 106 · see citing works
Self-citation
A Prolog technology theorem prover
Stickel, M. E. (1984) · New Generation Computing · doi:10.1007/bf03037328 · Cited by 105 · see citing works
An Assertion Language for Constraint Logic Programs
Puebla, G., Bueno, F., & Hermenegildo, M. V. (2000) · Lecture notes in computer science · doi:10.1007/10722311_2 · Cited by 100 · see citing works
Self-citation
The Boyer-Moore theorem prover and its interactive enhancement
Boyer, R. S., Kaufmann, M., & Moore, J. S. (1995) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(94)00215-7 · Cited by 100 · see citing works
The WAM - Definition and Compiler Correctness.
Börger, E., & Rosenzweig, D. (1995) · Cited by 99 · see citing works
Prolog: The Standard
Deransart, P., Ed-Dbali, A., & Cervoni, L. (1996) · Springer eBooks · doi:10.1007/978-3-642-61411-8 · Cited by 97 · see citing works
tu Prolog: A Light-Weight Prolog for Internet Applications and Infrastructures
Denti, E., Omicini, A., & Ricci, A. (2001) · International Symposium on Practical Aspects of Declarative Languages · doi:10.1007/3-540-45241-9_13 · Cited by 93 · see citing works
Design of the Kernel Language for the Parallel Inference Machine
Ueda, K. (1990) · The Computer Journal · doi:10.1093/comjnl/33.6.494 · Cited by 93 · see citing works
WASP: A Native ASP Solver Based on Constraint Learning
Alviano, M., Dodaro, C., Faber, W., Leone, N., & Ricca, F. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40564-8_6 · Cited by 91 · see citing works
On the integration of symbolic and sub-symbolic techniques for XAI: A survey
Calegari, R., Ciatto, G., & Omicini, A. (2020) · Intelligenza Artificiale · doi:10.3233/ia-190036 · Cited by 90 · see citing works
Self-citation
Design, implementation, and evaluation of the constraint language cc(FD)
Hentenryck, P. V., Saraswat, V., & Deville, Y. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59155-9_15 · Cited by 89 · see citing works
Parallel logic programming systems
de Kergommeaux, J. C., Codognet, P., & Institut National de Recherche en Informatique et en Automatique (INRIA), 7. R. (. U. D. R. D. R. (1992) · HAL · Cited by 88 · see citing works
Constraint Answer Set Programming without Grounding
ARIAS, J., CARRO, M., SALAZAR, E., MARPLE, K., & GUPTA, G. (2018) · Theory and Practice of Logic Programming · doi:10.1017/s1471068418000285 · Cited by 88 · see citing works
Curry: A Truly Functional Logic Language
Hanus, M., Kuchen, H., & Moreno-Navarro, J. (1995) · Cited by 84 · see citing works
Metastructures vs. attributed variables in the context of extensible unification
Holzbaur, C. (2006) · Springer eBooks · doi:10.1007/3-540-55844-6_141 · Cited by 83 · see citing works
Coinductive Logic Programming and Its Applications
Gupta, G., Bansal, A., Min, R., Simon, L., & Mallya, A. (2007) · Springer eBooks · doi:10.1007/978-3-540-74610-2_4 · Cited by 80 · see citing works
Turning 30: New Ideas in Inductive Logic Programming
Cropper, A., Dumančić, S., & Muggleton, S. (2020) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2020/673 · Cited by 78 · see citing works
Why Machine Learning May Lead to Unfairness: Evidence from Risk Assessment for Juvenile Justice in Catalonia
Tolan, S., Miron, M., Gómez, E., & Castillo, C. (2019) · Proceedings of the Seventeenth International Conference on Artificial Intelligence and Law · doi:10.1145/3322640.3326705 · Cited by 75 · see citing works
Logic program specialisation through partial deduction: Control issues
Leuschel, M., & Bruynooghe, M. (2002) · Theory and Practice of Logic Programming · doi:10.1017/s147106840200145x · Cited by 74 · see citing works
Self-citation
A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
Méndez-Lojo, M., Navas, J. A., & Hermenegildo, M. V. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-78769-3_11 · Cited by 74 · see citing works
Self-citation
1983–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 · see citing works
Prolog - the language and its implementation compared with Lisp
Warren, D. H. D., Pereira, L. M. C., & Pereira, F. M. B. (1977) · ACM SIGPLAN Notices · doi:10.1145/872734.806939 · Cited by 74 · see citing works
On database systems development through logic
Dahl, V. (1982) · ACM Transactions on Database Systems · doi:10.1145/319682.319700 · Cited by 73 · see citing works
Self-citation
The CORAL deductive system
Ramakrishnan, R., Srivastava, D., Sudarshan, S., & Seshadri, P. (1994) · The VLDB Journal · doi:10.1007/bf01228880 · Cited by 73 · see citing works
The muse approach to Or-parallel prolog
Ali, K. A. M., & Karlsson, R. (1990) · International Journal of Parallel Programming · doi:10.1007/bf01407834 · Cited by 70 · see citing works
A New Version of the Machine Translation System LMT
McCord, M. C. (1989) · Literary and Linguistic Computing · doi:10.1093/llc/4.3.218 · Cited by 70 · see citing works
Determination of variable dependence information at compile-time through abstract interpretation
Muthukumar, K., & Hermenegildo, M. V. (1989) · Archivo Digital UPM (Universidad Politécnica de Madrid) · Cited by 69 · see citing works
Self-citation
ECLiPSe – From LP to CLP
Schimpf, J., & Shen, K. (2011) · Theory and Practice of Logic Programming · doi:10.1017/s1471068411000469 · Cited by 69 · see citing works
Using Global Analysis, Partial Specifications, and an Extensible Assertion Language for Program Validation and Debugging
Hermenegildo, M. V., Puebla, G., & Bueno, F. (1999) · Artificial intelligence · doi:10.1007/978-3-642-60085-2_7 · Cited by 68 · see citing works
Self-citation
The language features and architecture of B-Prolog
Zhou, N. (2011) · Theory and Practice of Logic Programming · doi:10.1017/s1471068411000445 · Cited by 68 · see citing works
A Prolog technology theorem prover: a new exposition and implementation in Prolog
Stickel, M. E. (1992) · Theoretical Computer Science · doi:10.1016/0304-3975(92)90168-f · Cited by 67 · see citing works
Applied logic : its use and implementation as a programming tool
Warren, D. H. D. (1978) · ERA · Cited by 67 · see citing works
SWI-Prolog and the web
Wielemaker, J., Huang, Z., & van der Meij, L. (2008) · Theory and Practice of Logic Programming · doi:10.1017/s1471068407003237 · Cited by 65 · see citing works
Self-citation
Logic-Based Technologies for Intelligent Systems: State of the Art and Perspectives
Calegari, R., Ciatto, G., Denti, E., & Omicini, A. (2020) · Information · doi:10.3390/info11030167 · Cited by 63 · see citing works
Self-citation
SICStus Prolog—The first 25 years
Carlsson, M., & Mildner, P. (2011) · Theory and Practice of Logic Programming · doi:10.1017/s1471068411000482 · Cited by 61 · see citing works
A view of the origins and development of Prolog
Cohen, J. (1988) · Communications of the ACM · doi:10.1145/35043.35045 · Cited by 59 · see citing works
Towards a meaning of LIFE
Aı̈t-Kaci, H., & Podelski, A. (1991) · Lecture notes in computer science · doi:10.1007/3-540-54444-5_104 · Cited by 59 · see citing works
XSB as an efficient deductive database engine
Sagonas, K., Swift, T., & Warren, D. S. (1994) · ACM SIGMOD Record · doi:10.1145/191843.191927 · Cited by 59 · see citing works
HYPROLOG: A New Logic Programming Language with Assumptions and Abduction
Christiansen, H., & Dahl, V. (2005) · Lecture notes in computer science · doi:10.1007/11562931_14 · Cited by 54 · see citing works
Self-citation
Optimising Bytecode Emulation for Prolog
Costa, V. S. (1999) · Lecture notes in computer science · doi:10.1007/10704567_16 · Cited by 53 · see citing works
Self-citation
Experiments with a powerful parser
Kay, M. (1967) · International Conference on Computational Linguistics · doi:10.3115/991566.991575 · Cited by 53 · see citing works
On applying or-parallelism and tabling to logic programs
Rocha, R., Silva, F., & Costa, V. S. (2005) · Theory and Practice of Logic Programming · doi:10.1017/s1471068404002030 · Cited by 52 · see citing works
Self-citation
Allocation removal by partial evaluation in a tracing JIT
Bolz, C. F., Cuni, A., FijaBkowski, M., Leuschel, M., Pedroni, S., & Rigo, A. (2011) · ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) · doi:10.1145/1929501.1929508 · Cited by 52 · see citing works
Self-citation
Faithful Embeddings for Knowledge Base Queries
Sun, H., Arnold, A. O., Bedrax-Weiss, T., Pereira, F., & Cohen, W. W. (2020) · arXiv · doi:10.48550/arxiv.2004.03658 · Cited by 51 · see citing works
Co‐ordination of mobile information agents in TuCSoN
Omicini, A., & Zambonelli, F. (1998) · Internet Research · doi:10.1108/10662249810241266 · Cited by 50 · see citing works
A New Module System for Prolog
Cabeza, D., & Hermenegildo, M. V. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44957-4_9 · Cited by 50 · see citing works
Self-citation
Treating coordination in logic grammars
Dahl, V., & McCord, M. C. (1983) · Cited by 49 · see citing works
Self-citation
Agent-Based Explanations in AI: Towards an Abstract Framework
Ciatto, G., Schumacher, M., Omicini, A., & Calvaresi, D. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-51924-7_1 · Cited by 48 · see citing works
Self-citation
An Overview of Lambda Prolog
Nadathur, G., & Miller, D. (1988) · ScholarlyCommons (University of Pennsylvania) · Cited by 47 · see citing works
Computation of stable models and its integration with logical query processing
Chen, W., & Warren, D. S. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.542027 · Cited by 47 · see citing works
Artificial Intelligence, Machine Learning, and Bias In Finance: Toward Responsible Innovation
Johnson, K. N., Pasquale, F., & Chapman, J. E. (2019) · FLASH - Fordham Law Archive of Scholarship & History (Fordham University) · Cited by 46 · see citing works
Effectivness of abstract interpretation in automatic parallelization
Bueno, F., de la Banda, M. G., & Hermenegildo, M. V. (1999) · ACM Transactions on Programming Languages and Systems · doi:10.1145/316686.316688 · Cited by 45 · see citing works
Self-citation
A logical reconstruction of Prolog II
van Emden, M. H., & Lloyd, J. W. (1984) · The Journal of Logic Programming · doi:10.1016/0743-1066(84)90001-3 · Cited by 45 · see citing works
Logic Grammars
Abramson, H., & Dahl, V. (1989) · Springer eBooks · doi:10.1007/978-1-4612-3640-5 · Cited by 44 · see citing works
Self-citation
Assumption Grammars for Processing Natural Language
Dahl, V., Tarau, P., & Li, R. Z. (1997) · The MIT Press eBooks · doi:10.7551/mitpress/4299.003.0024 · Cited by 43 · see citing works
Self-citation
Integrating Software Testing and Run-Time Checking in an Assertion Verification Framework
Mera, E., López-García, P., & Hermenegildo, M. V. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02846-5_25 · Cited by 43 · see citing works
Self-citation
On implementing Prolog in functional programming
Carlsson, M. (1984) · New Generation Computing · doi:10.1007/bf03037326 · Cited by 42 · see citing works
The Finite Domain Constraint Solver of SWI-Prolog
Triska, M. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29822-6_24 · Cited by 41 · see citing works
Answer Set Programming: An Introduction to the Special Issue
Brewka, G., Eiter, T., & Truszczyński, M. (2016) · AI Magazine · doi:10.1609/aimag.v37i3.2669 · Cited by 41 · see citing works
Automatic compile-time parallelization of logic programs for restricted, goal level, independent and parallelism
Muthukumar, K., Bueno, F., de la Banda, M. G., & Hermenegildo, M. V. (1999) · The Journal of Logic Programming · doi:10.1016/s0743-1066(98)10022-5 · Cited by 40 · see citing works
Self-citation
Foundations of Probabilistic Logic Programming
Riguzzi, F. (2022) · River Publishers eBooks · doi:10.1201/9781003338192 · Cited by 40 · see citing works
A Top Down Interpreter for LPAD and CP-Logic
Riguzzi, F. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74782-6_11 · Cited by 39 · see citing works
Programming in CLP(BNR).
Older, W. J., & Benhamou, F. (1993) · Cited by 39 · see citing works
Towards Typed Prolog
Schrijvers, T., Costa, V. S., Wielemaker, J., & Demoen, B. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89982-2_59 · Cited by 38 · see citing works
Self-citation
Concurrency in Prolog using threads and a shared database
Carro, M., & Hermenegildo, M. V. (1999) · Cited by 38 · see citing works
Self-citation
The XSB Programming System.
Sagonas, K., Swift, T., & Warren, D. S. (1993) · DSpace - NTUA (National Technical University of Athens) · Cited by 37 · see citing works
Thesaurus-Based Search in Large Heterogeneous Collections
Wielemaker, J., Hildebrand, M., van Ossenbruggen, J., & Guus Schreiber, A. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88564-1_44 · Cited by 37 · see citing works
Self-citation
Introduction to React
Gackenheimer, C. (2015) · Apress eBooks · doi:10.1007/978-1-4842-1245-5 · Cited by 37 · see citing works
An Introduction to Prolog III
Colmerauer, A. (1990) · Springer eBooks · doi:10.1007/978-3-642-76274-1_2 · Cited by 37 · see citing works
Oz: a programming language for multi-agent systems
Henz, M., Smolka, G., & Würtz, J. (1993) · Cited by 36 · see citing works
Non-Deterministic Algorithms
Cohen, J. (1979) · ACM Computing Surveys · doi:10.1145/356770.356773 · Cited by 36 · see citing works
Programming finite-domain constraint propagators in Action Rules
Zhou, N. (2006) · Theory and Practice of Logic Programming · doi:10.1017/s1471068405002590 · Cited by 36 · see citing works
The WAM Case Study: Verifying Compiler Correctness for Prolog with KIV
Schellhorn, G., & Ahrendt, W. (1998) · Applied logic series · doi:10.1007/978-94-017-0437-3_7 · Cited by 35 · see citing works
Learning and reasoning in logic tensor networks
Serafini, L., Donadello, I., & Garcez, A. D. (2017) · Symposium on Applied Computing · doi:10.1145/3019612.3019642 · Cited by 35 · see citing works
Total Precedence Relations
Colmerauer, A. (1970) · Journal of the ACM · doi:10.1145/321556.321559 · Cited by 35 · see citing works
Entailment of Finite Domain Constraints
Carlson, B., Carlsson, M., Díaz, D., & Diaz, D. (1994) · The MIT Press eBooks · doi:10.7551/mitpress/4316.003.0038 · Cited by 33 · see citing works
Self-citation
A polymorphic type system with subtypes for Prolog
Dietrich, R., & Hagl, F. (1988) · Lecture notes in computer science · doi:10.1007/3-540-19027-9_6 · Cited by 33 · see citing works
Datalog: concepts, history, and outlook
Maier, D., Tekle, K. T., Kifer, M., & Warren, D. S. (2018) · ACM eBooks · doi:10.1145/3191315.3191317 · Cited by 33 · see citing works
Interval-based resource usage verification by translation into Horn clauses and an application to energy consumption
López-García, P., Darmawan, L., Klemen, M., Liqat, U., Bueno, F., & Hermenegildo, M. V. (2018) · Theory and Practice of Logic Programming · doi:10.1017/s1471068418000042 · Cited by 32 · see citing works
Self-citation
Anomalies in ontologies with rules
Baumeister, J., & Seipel, D. A. (2010) · Journal of Web Semantics · doi:10.1016/j.websem.2009.12.003 · Cited by 31 · see citing works
On the implementation ofGNU Prolog
Díaz, D., Abreu, S. P., & Codognet, P. (2011) · Theory and Practice of Logic Programming · doi:10.1017/s1471068411000470 · Cited by 31 · see citing works
Self-citation
A Generic Preprocessor for Program Validation and Debugging
Puebla, G., Bueno, F., & Hermenegildo, M. V. (2000) · Lecture notes in computer science · doi:10.1007/10722311_3 · Cited by 30 · see citing works
Self-citation
Some methodological issues in the design of CIAO, a generic, parallel concurrent constraint logic programming system
Hermenegildo, M. V. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58601-6_95 · Cited by 29 · see citing works
Self-citation
SociaLite: An Efficient Graph Query Language Based on Datalog
Seo, J., Guo, S. D., & Lam, M. S. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2015.2405562 · Cited by 29 · see citing works
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 · see citing works
Self-citation
Demand-Driven Indexing of Prolog Clauses
Costa, V. S., Sagonas, K., & Lopes, R. (2007) · Springer eBooks · doi:10.1007/978-3-540-74610-2_27 · Cited by 28 · see citing works
Self-citation
Objective: In Minimum Context
Abreu, S. P., & Díaz, D. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-24599-5_10 · Cited by 28 · see citing works
Self-citation
Resolution for Skeptical Stable Model Semantics
Bonatti, P. A. (2001) · Journal of Automated Reasoning · doi:10.1023/a:1011960831261 · Cited by 27 · see citing works
DCGs + Memoing = Packrat Parsing but Is It Worth It?
Becket, R., & Somogyi, Z. (2007) · Springer eBooks · doi:10.1007/978-3-540-77442-6_13 · Cited by 25 · see citing works
An introduction to LIFE-programming with logic, inheritance, functions, and equations
Aı̈t-Kaci, H. (1993) · International Conference on Logic Programming · Cited by 24 · see citing works
High-level languages for small devices
Carro, M., Morales, J. F., Muller, H. L., Puebla, G., & Hermenegildo, M. V. (2006) · International Conference on Compilers, Architecture, and Synthesis for Embedded Systems (CASES) · doi:10.1145/1176760.1176794 · Cited by 24 · see citing works
Self-citation
Abstract Domains Based on Regular Types
Gallagher, J. P., & Henriksen, K. S. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27775-0_3 · Cited by 23 · see citing works
Fixpoints for the masses: programming with first-class Datalog constraints
Madsen, M., & Lhoták, O. (2020) · Proceedings of the ACM on Programming Languages · doi:10.1145/3428193 · Cited by 23 · see citing works
Constraint Handling Rules and Tabled Execution
Schrijvers, T., & Warren, D. S. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27775-0_9 · Cited by 22 · see citing works
Reactive Computing as Model Generation
Kowalski, R., & Sadri, F. (2015) · New Generation Computing · doi:10.1007/s00354-015-0103-z · Cited by 22 · see citing works
Independence in CLP languages
de la Banda, M. G., Hermenegildo, M. V., & Marriott, K. (2000) · ACM Transactions on Programming Languages and Systems · doi:10.1145/349214.349224 · Cited by 22 · see citing works
Self-citation
Un sous-ensemble intéressant du français
Colmerauer, A. (1979) · RAIRO Informatique théorique · doi:10.1051/ita/1979130403091 · Cited by 21 · see citing works
Instruction merging and specialization in the SICStus Prolog virtual machine
Nässén, H., Carlsson, M., & Sagonas, K. (2001) · International Symposium on Principles and Practice of Declarative Programming (PPDP) · doi:10.1145/773184.773191 · Cited by 21 · see citing works
Parameter passing and control stack management in Prolog implementation revisited
Zhou, N. (1996) · ACM Transactions on Programming Languages and Systems · doi:10.1145/236114.236120 · Cited by 21 · see citing works
Andorra I
Costa, V. S., Warren, D. H. D., & Yang, R. (1991) · ACM SIGPLAN Notices · doi:10.1145/109626.109635 · Cited by 21 · see citing works
Self-citation
A Portable Prolog Compiler.
Bowen, D. L., Byrd, L., & Clocksin, W. F. (1983) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 21 · see citing works
Parallelizing irregular and pointer-based computations automatically: Perspectives from logic and constraint programming
Hermenegildo, M. V. (2000) · Parallel Computing · doi:10.1016/s0167-8191(00)00051-x · Cited by 19 · see citing works
Self-citation

Flagged first, then by citations

11 of the 309 references couldn’t be matched to a known paper.

Research works printed but not linked: 39

A¨ ıt-Kaci, H. , Dumant, B. , Meyer, R. , Podelski, A. and Roy, P. V. 1994. The Wild LIFE Handbook . Digital Paris Research Laboratory. Prepublication Edition.
Apt, K. and Wallace, M. 2007. Constraint Logic Programming Using ECLiPSe . Cambridge University Press.
Blackburn, P. , Bos, J. and Striegnitz, K. 2006. Learn Prolog Now! Vol. 7. College Publications Londres.
Byrd, L. 1980. Understanding the control flow of Prolog programs. In Proceedings Logic Programing Workshop , S. ˚ Ake T¨ arnlund, Ed., 127-138.
Carro, M. , Morales, J. , Muller, H. , Puebla, G. and Hermenegildo, M. V. 2006. Highlevel languages for small devices: A case study. In Proceedings CASES , K. Flautner and T. Kim, Eds. ACM Press/Sheridan, 271-281.
Ciatto, G. , Calegari, R. , Siboni, E. , Denti, E. and Omicini, A. 2020. 2P-Kt : Logic programming with objects & functions in Kotlin. In Proceedings WOA 2020 , R. Calegari, G. Ciatto, E. Denti, A. Omicini and G. Sartor, Eds. CEUR Workshop Proceedings, vol. 2706. CEUR, 219-236.
Clocksin, W. F. and Mellish, C. 1981. Programming in Prolog . Springer.
Codognet, P. and Diaz, D. 1995. wamcc: Compiling Prolog to C. In Proceedings ICLP , L. Sterling, Ed. MIT Press, 317-331.
Colmerauer, A. 1975. Les grammaires de m´ etamorphose GIA. Internal publication, Groupe Intelligence artificielle, Facult´ e des Sciences de Luminy, Universit´ e Aix-Marseille II, France, Nov 1975. English version, Metamorphosis grammars. In Natural Language Communication with Computers , L. Bolc, Ed. Lecture Notes in Computer Science, vol. 63. Springer, 1978, 133-189.
Colmerauer, A. 1982a. Prolog and infinite trees. In Proceedings Workshop on Logic Programming 1980 , K. L. Clark and S. ˚ Ake T¨ arnlund, Eds. Academic Press, 231-251.
Costa, V. S. , Warren, D. H. and Yang, R. 1991. Andorra I: A parallel Prolog system that transparently exploits both and-and or-parallelism. In Proceedings PPOPP , R. L. Wexelblat, Ed. ACM, 83-93.
Dahl, V. 1977. Un syst` eme d´ eductif d'interrogation de banques de donn´ ees en espagnol. Ph.D. thesis, Universit´ e d'Aix-Marseille II.
Dahl, V. 1992. Comment on implementing government-binding theories. In Formal Linguistics: Theory and Practice , R. Levine, Ed. Oxford University Press, 276-289.
Dahl, V. and Miralles, J. E. 2012. Womb grammars: Constraint solving for grammar induction. In Proceedings CHR , J. Sneyers and T. Fr¨ uhwirth, Eds. Report CW, vol. 624. KU Leuven, 32-40.
Dahl, V. and Tarau, P. 2004. Assumptive logic programming. In Proceedings ASAI .
Diaz, D. and Codognet, P. 1993. A minimal extension of the WAM for clp(FD). In Proceedings ICLP , D. S. Warren, Ed. MIT Press, 774-790.
Elcock, E. 1990. Absys: The first logic programming language. Journal of Logic Programming 9, 1, 1-17.
Forgy, C. L. 1989. Rete: A fast algorithm for the many pattern/many object pattern match problem. In Readings in Artificial Intelligence and Databases . Elsevier, 547-559.
Fr¨ uhwirth, T. 1992. Constraint simplification rules. In Proceedings JICSLP Workshop on Constraint Logic Programming . (Also available as Technical Report ECRC-92-18, ECRC Munich, Germany, July 1992).
Gebser, M. , Kaminski, R. , Kaufmann, B. and Schaub, T. 2014. Clingo = ASP + Control: Preliminary Report. arXiv 1405.3694. · arXiv
Hermenegildo, M. V. 2012. Conferences vs. Journals in CS, what to do? Evolutionary ways forward and the ICLP/TPLP model. In Publication Culture in Computing Research - Position Papers , K. Mehlhorn, M. Y. Vardi and M. Herbstritt, Eds. Dagstuhl Reports, vol. 12452. Dagstuhl Publishing, 29-30. URL: http://cliplab.org/papers/dagstuhl-tplpmove.pdf .
Hermenegildo, M. V. , Bueno, F. , Cabeza, D. , Carro, M. , Garcia de la Banda, M. , L´ opez-Garc´ ıa, P. and Puebla, G. 1996. The CIAO multi-dialect compiler and system: An experimentation workbench for future (C)LP systems (extended abstract). In Proceedings AGP , P. Lucio, M. Martelli and M. Navarro, Eds., 105-110.
Hill, P. and Lloyd, J. W. 1994. The G¨ odel Programming Language . MIT press.
Holzbaur, C. 1995. OFAI CLP(Q,R) Manual, Edition 1.3.3. Tech. Rep. TR-95-09, Austrian Research Institute for Artificial Intelligence, Vienna.
Kacsuk, P. and Wise, M. 1992. Implementations of Distributed Prolog . John Wiley & Sons, Inc.
Kowalski, R. 2020. Logical English. In Proceedings LPOP , D. Warren, P. V. Roy and Y. A. Liu, Eds. 33-37.
Marcus, G. and Davis, E. 2020. GPT-3, Bloviator: OpenAI's language generator has no idea what it's talking about. Technology Review .
Marple, K. , Salazar, E. and Gupta, G. 2017. Computing Stable Models of Normal Logic Programs Without Grounding. arXiv 1709.00501. · arXiv
Moura, P. 2003. Design of an Object-Oriented Logic Programming Language . Ph.D. thesis, Universidade da Beira Interior.
Neumerkel, U. 1990. Extensible unification by metastructures. In Proceedings META .
O'Keefe, R. A. 1990. The Craft of Prolog . MIT Press.
Pasero, R. 1973. Repr´ esentation du fran¸ cais en logique du premier ordre en vue de dialoguer avec un ordinateur . Ph.D. thesis, Facult´ e des Sciences de Luminy, Universit´ e Aix-Marseille II.
Pineda, A. and Bueno, F. 2002. The O'Ciao approach to object oriented logic programming. In Proceedings CICLOPS , B. Demoen, Ed. Report CW, vol. 344. KU Leuven, 37-48.
Pisano, G. , Calegari, R. , Omicini, A. and Sartor, G. 2020. Argtu Prolog: A tu Prolog-based argumentation framework. In Proceedings CILC , F. Calimeri, S. Perri and E. Zumpano, Eds. CEUR Workshop Proceedings, vol. 2719. CEUR, 51-66.
Roberts, G. M. 1977. An Implementation of PROLOG . Ph.D. thesis, University of Waterloo, Waterloo, Ontario, Canada. (Master Thesis).
Roussel, P. 1972. D´ efinition et traitement de l'´ egalit´ e formelle en d´ emonstration automatique . Ph.D. thesis, Facult´ e des Sciences de Luminy, Universit´ e Aix-Marseille II.
Santos Costa, V. , Sagonas, K. F. and Lopes, R. 2007. Demand-driven indexing of Prolog clauses. In Proceedings ICLP , V. Dahl and I. Niemel¨ a, Eds. LNCS, vol. 4670. Springer, 395409.
Warren, D. H. 1990. The extended Andorra model with implicit control. Presented at ICLP'90 Workshop on Parallel Logic Programming.
Zhou, N.-F. , Kjellerstrand, H. and Fruhman, J. 2015. Constraint Solving and Planning with Picat . SpringerBriefs in Intelligent Systems. Springer.

Sorted by citations

Logic-LM: Empowering Large Language Models with Symbolic Solvers for Faithful Logical Reasoning
Pan, L., Albalak, A., Wang, X., & Wang, W. Y. (2023) · arXiv · doi:10.48550/arxiv.2305.12295 · Cited by 144 · see citing works
“The Prolog logic programming language (Clocksin and Mellish, 2003; Körner et al., 2022) is arguably the most prominent symbolic language to describe deductive reasoning problems.”
Background
Large Knowledge Model: Perspectives and Challenges
Chen, H. (2024) · Data Intelligence · doi:10.3724/2096-7004.di.2024.0001 · Cited by 43 · see citing works
A universal knowledge model and cognitive architectures for prototyping AGI
Sukhobokov, A. A., Belousov, E. A., Gromozdov, D. R., Zenger, A. S., & Popov, I. A. (2024) · Cognitive Systems Research · doi:10.1016/j.cogsys.2024.101279 · Cited by 17 · see citing works
Symbolic knowledge extraction for explainable nutritional recommenders
Magnini, M., Ciatto, G., Cantürk, F., Aydoğan, R., & Omicini, A. (2023) · Computer Methods and Programs in Biomedicine · doi:10.1016/j.cmpb.2023.107536 · Cited by 11 · see citing works
Self-citation
JaKtA: BDI Agent-Oriented Programming in Pure Kotlin
Baiardi, M., Burattini, S., Ciatto, G., & Pianini, D. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-43264-4_4 · Cited by 11 · see citing works
Self-citation
LoRP: LLM-based Logical Reasoning via Prolog
Di, Z., Zhang, C., Lv, H., Cui, L., & Liu, L. (2025) · Knowledge-Based Systems · doi:10.1016/j.knosys.2025.114140 · Cited by 11 · see citing works
Toward Safe Autonomous Highway Driving Policies using a Neuro-Symbolic Deep Reinforcement Learning Approach
Sharifi, I., Yildirim, M., & Fallah, S. (2025) · Transportation Research Record Journal of the Transportation Research Board · doi:10.1177/03611981251357006 · Cited by 7 · see citing works
A declarative reasoning approach to conflict management in Intent-Based Networking
Massa, J., Forti, S., Paganelli, F., Dazzi, P., & Antonio Brogi, A. (2024) · Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN) · doi:10.1109/icin60470.2024.10494474 · Cited by 7 · see citing works
Parallel Logic Programming: A Sequel
Agostino Dovier, A., Formisano, A., Gupta, G., Hermenegildo, M. V., Pontelli, E., & Rocha, R. (2022) · Theory and Practice of Logic Programming · doi:10.1017/s1471068422000059 · Cited by 7 · see citing works
Self-citation
Blending BDI Agents with Object-Oriented and Functional Programming with JaKtA
Baiardi, M., Burattini, S., Ciatto, G., & Pianini, D. (2024) · SN Computer Science · doi:10.1007/s42979-024-03244-y · Cited by 3 · see citing works
Self-citation
Empower LlaMa 2 for Advanced Logical Reasoning in Natural Language UnderstandingPreprint
Watanabe, N., Kinasaka, K., & Nakamura, A. (2024) · Research Square · doi:10.21203/rs.3.rs-4333417/v1 · Cited by 5 · see citing works
Nemo: First Glimpse of a New Rule Engine
Ivliev, A., Ellmauthaler, S., Gerlach, L., Marx, M., Meißner, M., Meusel, S., & Krötzsch, M. (2023) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.385.35 · Cited by 4 · see citing works
Integrating Logic Rules with Everything Else, Seamlessly
Liu, Y. A., Stoller, S. D., Tong, Y., & LIN, B. (2023) · Theory and Practice of Logic Programming · doi:10.1017/s1471068423000108 · Cited by 4 · see citing works
How Well Students Perceive Their Understanding of Logic Programming Course Content?
Lovrenčić, S., & Sekovanić, V. (2023) · International Convention on Information and Communication Technology, Electronics and Microelectronics · doi:10.23919/mipro57284.2023.10159945 · Cited by 3 · see citing works
Bridging Large Language Models and Logic Programming
Crocetti, V., & Dragoni, A. F. (2025) · 2025 IEEE International Conference on Metrology for eXtended Reality, Artificial Intelligence and Neural Engineering (MetroXRAINE) · doi:10.1109/metroxraine66377.2025.11340308
Reason to Explain: Interactive Contrastive Explanations (REASONX)
State, L., Ruggieri, S., & Turini, F. (2023) · Communications in computer and information science · doi:10.1007/978-3-031-44064-9_22 · Cited by 2 · see citing works
Embedding a family of logic languages with custom monadic unification in Scala
Shevchenko, R., Doroshenko, А. Y., & Yatsenko, O. (2024) · PROBLEMS IN PROGRAMMING · doi:10.15407/pp2024.01.003 · Cited by 2 · see citing works
PrologMCP: A Standardized Prolog Tool Interface for LLM Agents
Mensfelt, A., Prabhakaran, A., Haret, A., Trencsenyi, V., & Stathis, K. (2026) · arXiv · doi:10.48550/arxiv.2606.14935 · Cited by 1 · see citing works
TRENDS AND INSIGHTS ON TOOLS USED FOR THE DEVELOPMENT OF EXPERT SYSTEMS: A SYSTEMATIC REVIEW OF RESEARCH ARTICLES (2018-2022)
Oloo, G. J. (2023) · International Journal of Engineering Applied Sciences and Technology · doi:10.33564/ijeast.2023.v08i01.050 · Cited by 1 · see citing works
Program Synthesis Using Inductive Logic Programming for the Abstraction and Reasoning Corpus
Rocha, F. M., Dutra, I., Costa, V. S., & Reis, L. P. (2025) · Communications in computer and information science · doi:10.1007/978-3-031-89366-7_4 · Cited by 1 · see citing works
Self-citation
Prolog-RAG: A Symbolic Reasoning Approach to Retrieval-Augmented Generation
Zhang, B., Li, J., Peng, K., Zheng, S., & Meng, K. (2025) · International Conference on Computer Engineering and Application (ICCEA) · doi:10.1109/iccea65460.2025.11103126 · Cited by 1 · see citing works
LLM-assisted formalization for deterministic detection of statutory inconsistency in tax law
Yadamsuren, B., Platt, S. K., & Diaz, M. (2026) · Artificial Intelligence and Law · doi:10.1007/s10506-026-09525-6 · Cited by 1 · see citing works
Virtual Machinations: Using Large Language Models as Neural Computers
Meijer, E. (2024) · Queue · doi:10.1145/3676287 · Cited by 1 · see citing works
Dimensions linguistiques de Prolog : le passé, le futur
Dahl, V. (2024) · Revue Ouverte d Intelligence Artificielle · doi:10.5802/roia.73 · Cited by 1 · see citing works
Self-citation
Making ProB Compatible with SWI-Prolog
Geleßus, D., & Leuschel, M. (2022) · Theory and Practice of Logic Programming · doi:10.1017/s1471068422000230 · Cited by 1 · see citing works
Self-citation
ADVENT: LLM-Driven Automatic Predicate Invention for ILP
Yu, T., Huang, P.-C., Hsu, C., Ku, C.-T., & Kang, Y. (2026) · 2026 IEEE International Conference on Information Reuse and Integration for Data Science (IRI) · doi:10.1109/iri69576.2026.00025
Exploiting Logic Programming for Runtime Verification: Current and Future Perspectives
Ancona, D., Ferrando, A., & Mascardi, V. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-35254-6_25
Declarative Reasoning on Explanations Using Constraint Logic Programming
State, L., Ruggieri, S., & Turini, F. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-43619-2_10
Diagnosis and treatment of Guillain-Barre using the prolog expert system
Andrade-Arenas, L., Molina-Velarde, P., Pucuhuayla-Revatta, F., & Yactayo-Arias, C. (2024) · Indonesian Journal of Electrical Engineering and Computer Science · doi:10.11591/ijeecs.v33.i1.pp333-342
Arabic natural language processing: Data science application in big data environment
Saif, S. M. (2024) · World Journal of Advanced Research and Reviews · doi:10.30574/wjarr.2024.24.2.3602
On Bridging Prolog and Python to Enhance an Inductive Logic Programming System
Costa, V. S., & Areias, M. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-84924-4_1
Self-citation
Hiord $^{{\kern2pt}\sharp}$ : An Approach to the Specification and Verification of Higher-Order (C)LP Programs
CICCALÈ, M., JURJO-RIVAS, D., Morales, J. F., López-García, P., & Hermenegildo, M. V. (2025) · Theory and Practice of Logic Programming · doi:10.1017/s147106842510015x
Self-citation
Vadacode: A Logician-Friendly IDE for Datalog ±
Bellomarini, L., Gentili, A., Magnanimi, D., & Sallinger, E. (2025) · Proceedings of the VLDB Endowment · doi:10.14778/3750601.3750684
Unveiling Seasonal Air Pollution Patterns with Data Mining
Orellana, M., Zambrano-Martínez, J. L., Pineda, D., & Vizhñay, S. (2025) · Communications in computer and information science · doi:10.1007/978-3-032-08366-1_4
Declarative Debugging for Modern Networks
Wang, A., & Caesar, M. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-15981-6_11
QLSL: A Symbolic Logic Enhanced Q-Learning Approach for Safe Autonomous Driving
Yao, X., Xi, Z., Ye, P., Wang, Z., & Wang, X. (2025) · International Conference on Cyber-Physical Social Intelligence (ICCSI) · doi:10.1109/cpsi66656.2025.11343953
Programming Languages
Haralambous, Y. (2026) · Elsevier eBooks · doi:10.1016/b978-0-323-95504-1.01412-5
Modeling automated legal and ethical compliance for trustworthy AI
Taheri, Y. (2024) · doi:10.70675/5971a37cz548bz4673z8186z5e4e8ed8cf1b
Intelligent Agents from Symbolic to Neurosymbolic Systems: The Quest for Integration
Agiollo, A., Calegari, R., Ciatto, G., Magnini, M., Omicini, A., & Sabbatini, F. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-22940-3_12
Self-citation
AiDER: Auditing and Document Evaluation via Rule Compilation and Small Language Models – An Education Case Study
Crocetti, V., Pacioni, E., Dragoni, A. F., Schumacher, M., & Calvaresi, D. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-40774-0_17
Autonomous Skill Development: Neuro-Symbolic Agents that Self-generate Verifiable Tools
Pacioni, E., Crocetti, V., Coman, A. C., Calvaresi, D., Manzo, G., & Schumacher, M. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-40774-0_36

Authors: KÖRNER, P., LEUSCHEL, M., BARBOSA, J., COSTA, V. S., DAHL, V., HERMENEGILDO, M. V., MORALES, J. F., WIELEMAKER, J., DIAZ, D., ABREU, S., & CIATTO, G.
Affiliations: Heinrich Heine University Düsseldorf (DE)
Universidade do Porto (PT)
Simon Fraser University (CA)
IMDEA Software Institute (ES)
Centrum Wiskunde & Informatica (NL)
University of Évora (PT)
University of Bologna (IT)
ORCID: KÖRNER, PHILIPP
LEUSCHEL, MICHAEL
BARBOSA, JOÃO
COSTA, VÍTOR SANTOS
DAHL, VERÓNICA
HERMENEGILDO, MANUEL V.
MORALES, JOSE F.
WIELEMAKER, JAN
DIAZ, DANIEL
ABREU, SALVADOR
CIATTO, GIOVANNI
Venue: Theory and Practice of Logic Programming
Publisher: Cambridge University Press (CUP)
Published: 2022-05-17
Volume: 22
Issue: 6
Pages: 776-858
ISSN: 1471-0684 (ISSN-L)
1475-3081
DOI: 10.1017/s1471068422000102
OpenAlex: W4280605585
Cited by: 40
References: 309
Citations by year: 2026: 7 · 2025: 10 · 2024: 11 · 2023: 10 · 2022: 2
FWCI: 2.71
Type: journal article
Language: en
Open access: hybrid
doi.org
Licence: cc-by-sa
creativecommons.org/licenses/by/4.0/ (unspecified)
Locations: Theory and Practice of Logic Programming (publishedVersion, cc-by-sa)
Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna) (submittedVersion, cc-by-sa)
Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands (submittedVersion, public-domain)
HAL (submittedVersion)
Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT) (submittedVersion, other-oa)
Funders: Ministerio de Ciencia e Innovación (PID2019)
NOVA Laboratory for Computer Science and Informatics (UIDB/04516/2020)
Natural Sciences and Engineering Research Council of Canada
Fundação para a Ciência e a Tecnologia (UIDB/04516/2020)
Topics: Physical Sciences › Computer Science › Artificial Intelligence › Logic, programming, and type systems
Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
Physical Sciences › Computer Science › Computer Science Applications › Teaching and Learning Programming
Keywords: Prolog, logic programming, Prolog implementation, code portability, logic programming languages, SWOT analysis

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

Fifty Years of Prolog and Beyond

Abstract

Integrity signals

Claims the paper makes

Claims other papers make about this one

Self-check

Cites

Cited by

Related

Record

About these checks