Artificial intelligence : a modern approach

Print version:

Cover; Artificial Intelligence A Modern Approach; Copyright; Dedication; Preface; About the Authors; Contents; 1. Introduction; 1.1 What Is AI?; 1.2 The Foundations of Artificial Intelligence; 1.3 The History of Artificial Intelligence; 1.4 The State of the Art; 1.5 Summary, Bibliographical and Historical Notes, Exercises; 2. Intelligent Agents; 2.1 Agents and Environments; 2.2 Good Behavior: The Concept of Rationality; 2.3 The Nature of Environments; 2.4 The Structure of Agents; 2.5 Summary, Bibliographical and Historical Notes, Exercises; 3. Solving Problems by Searching 3.1 Problem-Solving Agents3.2 Example Problems; 3.3 Searching for Solutions; 3.4 Uninformed Search Strategies; 3.5 Informed (Heuristic) Search Strategies; 3.6 Heuristic Functions; 3.7 Summary, Bibliographical and Historical Notes, Exercises; 4. Beyond Classical Search; 4.1 Local Search Algorithms and Optimization Problems; 4.2 Local Search in Continuous Spaces; 4.3 Searching with Nondeterministic Actions; 4.4 Searching with Partial Observations; 4.5 Online Search Agents and Unknown Environments; 4.6 Summary, Bibliographical and Historical Notes, Exercises; 5. Adversarial Search; 5.1 Games 5.2 Optimal Decisions in Games5.3 Alpha-Beta Pruning; 5.4 Imperfect Real-Time Decisions; 5.5 Stochastic Games; 5.6 Partially Observable Games; 5.7 State-of-the-Art Game Programs; 5.8 Alternative Approaches; 5.9 Summary, Bibliographical and Historical Notes, Exercises; 6. Constraint Satisfaction Problems; 6.1 Defining Constraint Satisfaction Problems; 6.2 Constraint Propagation: Inference in CSPs; 6.3 Backtracking Search for CSPs; 6.4 Local Search for CSPs; 6.5 The Structure of Problems; 6.6 Summary, Bibliographical and Historical Notes, Exercises; 7. Logical Agents; 7.1 Knowledge-Based Agents 7.2 The Wumpus World7.3 Logic; 7.4 Propositional Logic: A Very Simple Logic; 7.5 Propositional Theorem Proving; 7.6 Effective Propositional Model Checking; 7.7 Agents Based on Propositional Logic; 7.8 Summary, Bibliographical and Historical Notes, Exercises; 8. First-Order Logic; 8.1 Representation Revisited; 8.2 Syntax and Semantics of First-Order Logic; 8.3 Using First-Order Logic; 8.4 Knowledge Engineering in First-Order Logic; 8.5 Summary, Bibliographical and Historical Notes, Exercises; 9. Inference in First-Order Logic; 9.1 Propositional vs. First-Order Inference 9.2 Unification and Lifting9.3 Forward Chaining; 9.4 Backward Chaining; 9.5 Resolution; 9.6 Summary, Bibliographical and Historical Notes, Exercises; 10. Classical Planning; 10.1 Definition of Classical Planning; 10.2 Algorithms for Planning as State-Space Search; 10.3 Planning Graphs; 10.4 Other Classical Planning Approaches; 10.5 Analysis of Planning Approaches; 10.6 Summary, Bibliographical and Historical Notes, Exercises; 11. Planning and Acting in the Real World; 11.1 Time, Schedules, and Resources; 11.2 Hierarchical Planning; 11.3 Planning and Acting in Nondeterministic Domains