Table of Contents
1.1. Logic, foundations of computer science, and applications of logic to computer science
1.2. On the utility of logic for computer engineers
Chapter 2: A Few Thoughts Before the Formalization
Chapter 3: Propositional Logic
3.2. The method of semantic tableaux
3.4. A formal system for PL (PC)
3.5. The method of Davis and Putnam
3.7. The resolution method in PL
3.8. Problems, strategies, and statements
3.10. Algebraic point of view of propositional logic
4.2. First-order terms, substitutions, unification
Chapter 5: First-Order Logic (FOL) or Predicate Logic (PL1, PC1)
5.4. Unification in the method of semantic tableaux
5.5. Toward a semi-decision procedure for FOL
5.7. The resolution method in FOL
5.8. A decidable class: the monadic class
5.9. Limits: Gödel’s (first) incompleteness theorem
Chapter 6: Foundations of Logic Programming
6.1. Specifications and programming
6.2. Toward a logic programming language
6.3. Logic programming: examples
6.4. Computability and Horn clauses
Chapter 7: Artificial Intelligence
7.2. What approaches to study AI?
7.3. Toward an operational definition of intelligence
7.4. Can we identify human intelligence with mechanical intelligence?
7.6. Some undisputed themes in AI
8.2. An important concept: clause subsumption
8.5. Generalization: the generation of inductive hypotheses
Chapter 9: Problem Specification in Logical Languages
9.3. Second Order Logic (SOL): a few notions
Chapter 10: Non-Classical Logics
10.2. Inaccurate concepts: fuzzy logic
10.4. Some elements of temporal logic
Chapter 11: Knowledge and Logic: Some Notions
11.2. Knowledge and modal logic