×

From logic to logic programming. (English) Zbl 0834.68007

MIT Press Series in the Foundations of Computing. Cambridge: MIT Press. xiv, 214 p. (1994).
The present textbook gives a mathematically oriented introduction to the theory of logic programming and presents a systematic exposition of the resolution method for propositional logic, first-order logic and Horn- clauses logic, together with an analysis of the semantic aspects. The concept of resolvent is defined nonconstructively, allowing short versions and proofs of the fundamental results of logic programming. A crash course in recursion theory shows that all recursive functions are countable by a logical program. Advanced topics such as recursive complexity and negation as failure and its semantics are covered, and SLD- and SLDNF-resolution are described. The last chapter discusses Fitting’s 3-valued interpretation of SLDNF-resolution and Stärk’s completeness theorem.

MSC:

68N17 Logic programming
68-01 Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
PDFBibTeX XMLCite