Foundations of deductive databases and logic programming
Foundations of Deductive Databases and Logic Programming
| Otros Autores: | , |
|---|---|
| Formato: | Libro electrónico |
| Idioma: | Inglés |
| Publicado: |
Los Altos, California :
Morgan Kaufmann Publishers, Inc
1988.
|
| Materias: | |
| Ver en Biblioteca Universitat Ramon Llull: | https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009644278206719 |
Tabla de Contenidos:
- Front Cover; Dedication; Foundations of Deductive Databases and Logic Programming; Copyright Page; Table of Contents; Introduction; Background; Workshop on Foundations of Deductive Databases and Logic Programming; Overview of Book; Future Directions; Summary; Acknowledgments; References; PART I: NEGATION AND STRATIFIED DATABASES; Chapter 1. Negation in Logic Programming; Abstract; Introduction; Fixpoint Models; The Closed World Assumption; The Completed Database; The Relation between the Closed World Assumption and the Completed Database; Negation as Failure
- Semantics for Negation in Terms of Special Classes of ModelsSemantics for Negation as Failure in Terms of 3-Valued Logic; Acknowledgments; References; Chapter 2. Towards a Theory of Declarative Knowledge; Abstract; Introduction; Preliminaries; Stratified Programs; From Models to Fixed Points; Fixed Point Theory of Nonmonotonic Operators; Model Theory of Stratified Programs; An Elementary Interpreter; Existence of the Interpreter; Other Views of Negation and Stratified Programs; Completions of Programs; Related Work; References
- Chapter 3. Negation as Failure Using Tight Derivations for General Logic ProgramsAbstract; Introduction; General Logic Programs and Safe Negation; Rule-based Negation-as-Failure Semantics; Counter-Intuitive Meanings of Rule-based Semantics; Tree-oriented Semantics for Negation as Failure; Freedom from Recursive Negation; Practical Algorithms; Conclusion; Acknowledgments; References; Chapter 4 On the Declarative Semantics of Logic Programs with Negation; Abstract; Introduction; Logic Programs and Circumscription; Iterated Fixed Points; Proof of Theorem 1; Proof of Theorem 3; Acknowledgments
- ReferencesChapter 5. On the Declarative Semantics of Deductive Databases and Logic Programs; Abstract; Introduction; Minimal Model Semantics; Minimal Model Semantics Is Not Sufficient for General Databases; Perfect Model Semantics; Relation to Prioritized Circumscription; Acknowledgments; References; Chapter 6. On Domain Independent Databases; Abstract; Introduction; Basic Concepts; Domain Independent Formulas; Domain Independent Databases; On Correct Answers; Conclusions; Acknowledgments; References; PART II: FUNDAMENTAL ISSUES IN DEDUCTIVE DATABASES AND IMPLEMENTATION
- Chapter 7. Foundations of Semantic Query Optimization for Deductive DatabasesAbstract; Introduction; Overview of Semantic Query Optimization; Assumptions; Semantic Compilation; Semantic Query Transformation; Extensions; Acknowledgments; References; Chapter 8. Intelligent Query Answering in Rule Based Systems; Abstract; Introduction; Basic Notions; Rules in Answers-Rule Transformation; Infinite Answers, Functions, and Predicates in the Answers for Queries; Conclusions; Appendix; Acknowledgment; References; Chapter 9. A Theorem-Proving Approach to Database Integrity; Abstract; Introduction
- Definitions
