Table of Contents

1. Preliminaries.- §1. Introduction.- §2. First Order Theories.- §3. Interpretations and Models.- §4. Unification.- §5. Fixpoints.- Problems for Chapter 1.- 2. Definite Programs.- §6. Declarative Semantics.- §7. Soundness of SLD-Resolution.- §8. Completeness of SLD-Resolution.- §9. Independence of the Computation Rule.- §10. SLD-Refutation Procedures.- §11. Cuts.- Problems for Chapter 2.- 3. Normal Programs.- §12. Negative Information.- §13. Finite Failure.- §14. Programming with the Completion.- §15. Soundness of SLDNF-Resolution.- §16. Completeness of SLDNF-Resolution.- Problems for Chapter 3.- 4. Programs.- §17. Introduction to Programs.- §18. SLDNF-Resolution for Programs.- §19. Declarative Error Diagnosis.- §20. Soundness and Completeness of the Diagnoser.- Problems for Chapter 4.- 5. Deductive Databases.- §21. Introduction to Deductive Databases.- §22. Soundness of Query Evaluation.- §23. Completeness of Query Evaluation.- §24. Integrity Constraints.- Problems for Chapter 5.- 6. Perpetual Processes.- §25. Complete Herbrand Interpretations.- §26. Properties of T’p.- §27. Semantics of Perpetual Processes.- Problems for Chapter 6.- References.- Notation.

Promotional Information

Springer Book Archives