Foundations of logic programming

✍ Scribed by John Wylie Lloyd

• Publisher: Springer
• Year: 1987
• Tongue: English
• Leaves: 228
• Edition: 2nd
• Category: Library

✦ Synopsis

This is the second edition of 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. In addition to presenting the technical results, the book also contains many illustrative examples. Many of the examples and problems are part of the folklore of Logic Programming and are not easily obtainable elsewhere. The second edition contains about 70 % more material than the first edition. There are two new chapters, one on a more general class of programs in which the body of a program statement can be an arbitrary first order formula, and one on Deductive Database Systems. Further material on negation has been added to the third chapter. In addition, the problem sections of each chapter have been expanded so that there are now over 100 problems. The book is intended to be self-contained, the only prerequisites being some familarity with PROLOG and knowledge of some basic undergraduate mathematics. The book is aimed at researchers and graduate students in Logic Programming, Artificial Intelligence and Database Systems. The material is suitable either as a reference book for researchers or as a text book for a graduate course on the theoretical aspects of Logic Programming and Deductive Database Systems.

✦ Table of Contents

PREFACE TO THE SECOND EDITION......Page 7
PREFACE TO THE FIRST EDITION......Page 9
CONTENTS......Page 11
§1. Introduction......Page 13
§2. First Order Theories......Page 16
§3. Interpretations and Models......Page 22
§4. Unification......Page 32
§5. Fixpoints......Page 38
Problems for Chapter1......Page 43
§6. Declarative Semantics......Page 47
§7. Soundness of SLD-Resolution......Page 52
§8. Completeness of SLD-Resolution......Page 59
§9. Independence of the Computation Rule......Page 61
§10. SLD-Refutation Procedures......Page 67
§11. Cuts......Page 75
Problems for Chapter2......Page 78
§ 12. Negative Information......Page 83
§ 13. Finite Failure......Page 86
§ 14. Programming with the Completion......Page 89
§ 15. Soundness of SLDNF-Resolution......Page 96
§ 16. Completeness of SLDNF-Resolution......Page 107
Problems for Chapter3......Page 114
§ 17. Introduction to Programs......Page 119
§ 18. SLDNF-Resolution for Programs......Page 124
§ 19. Declarative Error Diagnosis......Page 131
§ 20. Soundness and Completeness of the Diagnoser......Page 142
Problems for Chapter4......Page 148
§21. Introduction to Deductive Databases......Page 153
§22. Soundness of Query Evaluation......Page 162
§23. Completeness of Query Evaluation......Page 168
§24. Integrity Constraints......Page 170
Problems for Chapter5......Page 181
§25. Complete Herbrand Interpretations......Page 185
§26. Properties of T'_p......Page 194
§27. Semantics of Perpetual Processes......Page 200
Problems for Chapter6......Page 204
REFERENCES......Page 207
NOTATION......Page 217
INDEX......Page 219