Description
Book Synopsis
1 Search-Related Techniques in AI.- Why search.- Objectives.- Problem-solving systems.- State space search and problem reduction.- Blind search and heuristic search.- Graphs and trees.- Organisation of the book.- Searching for a solution path in a state space.- Problem reduction.- A very brief comparison of POP-11 and Prolog.- Further reading.- 2 Simple State Space Search.- Path-finding.- Setting up the database.- Setting up the path-finding function.- The generality of search.- Search spaces and search trees.- Constructing an explicit representation of the search-tree.- Search graphs.- Node terminology.- Backwards v. forwards searching.- OR-tree search in Prolog.- Reading.- Exercises.- 3 State Space Search.- The water jugs problem.- Constructing successor nodes.- The problem space.- Searching for a solution path.- Problem space exploration strategies.- Breadth-first search.- Agendas.- Implementing depth-first search using an agenda.- Iterative deepening.- Water jugs in Prolog.- Agenda
Table of Contents
1. Search-Related Techniques in AI. 2. Simple State Space Search. 3. State-Space Search. 4. Heuristic State-Space Search. 5. Heuristc Search of Game Trees. 6. Problem Reduction (AND/OR-Tree Search). 7. Planning (Microworld Search). 8. Parsing (Search as Analysis). 9. Expert Systems (Probabilistic Search). 10. Concept Learning (Extension-Generating Search). 11. Prolog (Search as Computation). 12. References. Introduction to POP-11 Programming. Index.