Logic for Computer Science and Artificial Intelligence

Table of Contents

Preface

Chapter 1: Introduction

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

2.1. What is logic?

2.2. Some historic landmarks

Chapter 3: Propositional Logic

3.1. Syntax and semantics

3.2. The method of semantic tableaux

3.3. Formal systems

3.4. A formal system for PL (PC)

3.5. The method of Davis and Putnam

3.6. Semantic trees in PL

3.7. The resolution method in PL

3.8. Problems, strategies, and statements

3.9. Horn clauses

3.10. Algebraic point of view of propositional logic

Chapter 4: First-order Terms

4.1. Matching and unification

4.2. First-order terms, substitutions, unification

Chapter 5: First-Order Logic (FOL) or Predicate Logic (PL1, PC1)

5.1. Syntax

5.2. Semantics

5.3. Semantic tableaux in FOL

5.4. Unification in the method of semantic tableaux

5.5. Toward a semi-decision procedure for FOL

5.6. Semantic trees in 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.1. Intelligent systems: AI

7.2. What approaches to study AI?

7.3. Toward an operational definition of intelligence

7.4. Can we identify human ...