jwl@mulga.OZ (John Lloyd) (11/20/84)
[]
AVAILABLE NOW
Foundations of Logic Programming
J.W. Lloyd
Springer-Verlag, Symbolic Computation Series, ISBN 3-540-13299-6
This is the first book to give an account of the mathematical foundations
of Logic Programming. Its purpose is to collect, in a unified and
comprehensive manner, the basic theoretical results of Logic Programming,
which have previously only been available in widely scattered research
papers.
The book is intended to be self-contained, the only prerequisites being
some familiarity with PROLOG and knowledge of some basic undergraduate
mathematics.
As well as presenting the technical results, the book also contains many
illustrative examples and a list of problems at the end of each chapter.
Many of the examples and problems are part of the folklore of Logic
Programming and are not easily obtainable elsewhere.
CONTENTS
Chapter 1. DECLARATIVE SEMANTICS
section 1. Introduction
section 2. Logic programs
section 3. Models of logic programs
section 4. Answer substitutions
section 5. Fixpoints
section 6. Least Herbrand model
Problems for chapter 1
Chapter 2. PROCEDURAL SEMANTICS
section 7. Soundness of SLD-resolution
section 8. Completeness of SLD-resolution
section 9. Independence of the computation rule
section 10. SLD-refutation procedures
section 11. Cuts
Problems for chapter 2
Chapter 3. NEGATION
section 12. Negative information
section 13. Finite failure
section 14. Programming with the completion
section 15. Soundness of the negation as failure rule
section 16. Completeness of the negation as failure rule
Problems for chapter 3
Chapter 4. PERPETUAL PROCESSES
section 17. Complete Herbrand interpretations
section 18. Properties of T'
section 19. Semantics of perpetual processes
Problems for chapter 4