Lloyd Foundations of Logic Programming

Erscheinungsjahr 2012
ISBN: 978-3-642-96826-6
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, eBook

Reihe: Symbolic Computation

This book gives an account oC the mathematical Coundations oC logic programming. I have attempted to make the book selC-contained by including prooCs of almost all the results needed. The only prerequisites are some Camiliarity with a logic programming language, such as PROLOG, and a certain mathematical maturity. For example, the reader should be Camiliar with induction arguments and be comCortable manipulating logical expressions. Also the last chapter assumes some acquaintance with the elementary aspects of metric spaces, especially properties oC continuous mappings and compact spaces. Chapter 1 presents the declarative aspects of logic programming. This chapter contains the basic material Crom first order logic and fixpoint theory which will be required. The main concepts discussed here are those oC a logic program, model, correct answer substitution and fixpoint. Also the unification algorithm is discussed in some detail. Chapter 2 is concerned with the procedural semantics oC logic programs. The declarative concepts are implemented by means oC a specialized Corm oC resolution, called SLD-resolution. The main results of this chapter concern the soundness and completeness oC SLD-resolution and the independence oC the computation rule. We also discuss the implications of omitting the occur check from PROLOG implementations. Chapter 3 discusses negation. Current PROLOG systems implement a form of negation by means of the negation as failure rule. The main results of this chapter are the soundness and completeness oC the negation as failure rule.

Zielgruppe

Research

Autoren/Hrsg.

Lloyd, J. W.

Inhaltsverzeichnis

1. Declarative Semantics.- §1. Introduction.- §2. Logic programs.- §3. Models of logic programs.- §4. Answer substitutions.- §5. Fixpoints.- §6. Least Herbrand model.- 2. Procedural Semantics.- §7. Soundness of SLD-resolution.- §8. Completeness of SLD-resolution.- §9. Independence of the computation rule.- §10. SLD-refutation procedures.- §11. Cuts.- 3. Negation.- §12. Negative information.- §13. Finite failure.- §14. Programming with the completion.- §15. Soundness of the negation as failure rule.- §16. Completeness of the negation as failure rule.- 4. Perpetual Processes.- §17. Complete Herbrand interpretations.- §18. Properties of Tp.- §19. Semantics of perpetual processes.- References.- Notation.