From logic to logic programming / Kees Doets.
Saved in:
| Online Access: |
Full Text (via Internet Archive) |
|---|---|
| Main Author: | |
| Format: | eBook |
| Language: | English |
| Published: |
Cambridge, Mass. :
MIT Press,
℗♭1994.
|
| Series: | Foundations of computing.
|
| Subjects: |
Table of Contents:
- 1. Preliminaries. 1.1. Mathematical Induction. 1.2. Trees. 1.3. Multisets. 1.4. Ordinals and Cardinals
- 2. Propositional Logic. 2.1. Syntax. 2.2. Semantics. 2.3. Conjunctive Normal Form. 2.4. Resolution
- 3. First-order Logic. 3.1. Introduction. 3.2. Syntax. 3.3. Semantics. 3.4. Quantifier-free Sentences. 3.5. Universal Sentences. 3.6. Prenex and Skolem Forms. 3.7. Resolution: The Unrestricted Version. 3.8. Unification. 3.9. Resolution
- 4. Program-definability. 4.1. Programs. 4.2. The Least Herbrand Model. 4.3. Fixed Points. 4.4. Hierarchies. 4.5. Definability. 4.6. Representing Domains as Herbrand Universes
- 5. Linear Resolution. 5.1. Preliminaries. 5.2. Unrestricted Linear Resolution. 5.3. Ground Completeness. 5.4. Linear Resolution. 5.5. SLD-Resolution
- 6. Infinite Derivations. 6.1. Negative Information. 6.2. Non-standard Algebras. 6.3. Resolution over Non-standard Algebras. 6.4. Realization Trees. 6.5. The Interplay of SLD-trees and Realization Trees
- 7. Computability. 7.1. Preliminaries.
- 7.2. Computability of Recursive Functions. 7.3. Complexity of T[subscript p][actual symbol not reproducible]
- 8. Negation. 8.1. Introduction. 8.2. Negation Implemented: SLDNF. 8.3. 3-Valued Models. 8.4. 3-Valued Consequence Operator. 8.5. Soundness. 8.6. Saturation. 8.7. Completeness for SLDNF.