Foundations of Logic Programming

Part of the Universitext book series (UTX)


Logic programming aims not so much at solving numerical problems in science and technology, as at treating information processing in general, in particular at the creation of expert systems of artificial intelligence. A distinction has to be made between logic programming as theoretical subject matter and the widely used programming language for practical tasks of this kind, PROLOG. In regard to the latter, we confine ourselves to a presentation of a somewhat simplified version, which nonetheless preserves the typical features.

The notions dealt with in 4.1 are of fairly general nature. Their origin lies in certain theoretical questions posed by mathematical logic, and they took shape before the invention of the computer. For certain sets of formulas, in particular for sets of universal Horn formulas, which are very important for logic programming, term models are obtained canonically. The newcomer need not understand all details of 4.1 at once, but should learn about Horn formulas in 4.2 and after a glance at the theorems may then continue with 4.3.


Logic Program Logic Programming Conjunctive Normal Form Horn Clause Relation Symbol 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. Ll.
    J. W. Lloyd, Foundations of Logic Programming, Berlin 1984, 2⟨{ nd}⟩ ed. Springer 1987.Google Scholar
  2. Hor.
    A. Horn, On sentences which are true of direct unions of algebras, J. Symb. Logic 16 (1951), 14–21.Google Scholar
  3. GJ.
    M. Garey, D. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, Freeman 1979.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Fachbereich Mathematik und InformatikBerlinGermany

Personalised recommendations