Logic Programming

Logic Programming
Name	Logic Programming
Paradigm	Declarative programming, rule-based programming
Designer	John McCarthy; Robert Kowalski
First appeared	1972 (Prolog)
Typing	Dynamic, untyped
Influenced by	Alonzo Church, Alan Turing, Kurt Gödel, Alfred Tarski
Influenced	Constraint Logic Programming, Answer Set Programming, Inductive Logic Programming, Knowledge Representation

Logic Programming is a declarative programming paradigm centered on formal logic, where programs consist of logical sentences and computation is performed by inference. It traces intellectual roots to formal logicians and early computing theorists and has been implemented in systems used in artificial intelligence, databases, and verification. The paradigm interconnects with developments in automated reasoning, proof theory, and symbolic computation established by prominent figures and institutions.

Overview

Logic programming emerged from the intersection of work by John McCarthy, Robert Kowalski, Alonzo Church, and Alan Turing and formal results by Kurt Gödel and Alfred Tarski. Early systems such as Prolog were developed within academic contexts including University of Edinburgh, University of Marseille, and industry laboratories like SRI International and IBM Research. It influenced and was influenced by projects at DARPA, standards efforts at ISO, and theoretical programs at Princeton University and MIT. Key conferences where research matured include IJCAI, AAAI, ICLP, and FLoC.

Foundations and Semantics

The theoretical basis builds on work by Alonzo Church and the Lambda calculus tradition, model theory from Alfred Tarski, and proof-theoretic results by Gerhard Gentzen and Kurt Gödel. Semantics have multiple formalizations: declarative model-theoretic semantics referenced in textbooks from Stanford University and Cambridge University Press, operational semantics shaped by execution engines from University of Edinburgh groups, and fixpoint semantics related to work by Dana Scott and Michael O. Rabin. Non-monotonic extensions draw on research by Ray Reiter, John McCarthy, and Moses M. Schaeffer; stable model semantics were formalized by Michael Gelfond and Vladimir Lifschitz. Constraint semantics connect with contributions from Joxan Jaffar, Michael Maher, and projects at SRI International.

Languages and Implementations

Canonical languages include Prolog variants developed at University of Marseille and University of Edinburgh, Mercury from University of Melbourne and University of Melbourne collaborators, Datalog used in systems at Bell Labs and Microsoft Research, and Answer Set Programming tools created by teams at University of Texas at Dallas and University of Potsdam. Implementations and systems include engines from SWI-Prolog contributors, commercial products by IBM Research, constraint systems from SICStus Prolog authors, rule engines in Oracle Corporation products, and research implementations at Microsoft Research and Google projects. Tooling and IDE work has been advanced by groups at Eclipse Foundation, GNU Project, and European Space Agency research labs.

Programming Paradigms and Techniques

Core techniques include resolution and unification developed in the tradition of Alonzo Church and Alan Robinson and clause-splitting strategies influenced by work at University of Edinburgh. Extensions and paradigms incorporate constraint solving researched at SRI International and University of Melbourne, probabilistic logic programming advanced by researchers at Carnegie Mellon University and University of Cambridge, and inductive learning approaches developed at University of Oxford and University of London groups. Meta-programming and reflection were explored in projects at MIT Artificial Intelligence Laboratory and Stanford University, while concurrency models were proposed in collaborations involving INRIA and University of Bath.

Applications

Applications span automated planning and scheduling in projects funded by DARPA and implemented in collaborations with NASA, knowledge-based systems for European Space Agency missions, natural language processing tools developed at Bell Labs and Carnegie Mellon University, semantic web reasoning in standards work at W3C, and configuration management systems used by Siemens and Bosch. Database querying and analysis using Datalog has been deployed by Google for program analysis and by Facebook for graph analytics; security policy engines incorporate logic-based policies in products by Microsoft Corporation and Amazon Web Services. Bioinformatics tools leveraging rule-based inference were produced in collaborations with Wellcome Trust and Broad Institute research teams.

Criticisms and Limitations

Critiques have arisen in context of scalability and performance relative to imperative languages used in industry, noted in industry reports by Gartner and studies at Stanford University and UC Berkeley. Integration issues with mainstream ecosystems were observed by engineers at Google and Microsoft Research, and debugging and tooling shortcomings were reported in projects at Eclipse Foundation and GNU Project. The tension between declarative semantics and operational control has been a subject of debate in panels at IJCAI and AAAI and in position papers from MIT and Princeton University researchers. Advances addressing these limits continue in collaborations across DARPA, European Commission research programs, and industrial research labs such as IBM Research.

Category:Programming paradigms