Principles of Artificial IntelligenceA classic introduction to artificial intelligence intended to bridge the gap between theory and practice, Principles of Artificial Intelligence describes fundamental AI ideas that underlie applications such as natural language processing, automatic programming, robotics, machine vision, automatic theorem proving, and intelligent data retrieval. Rather than focusing on the subject matter of the applications, the book is organized around general computational concepts involving the kinds of data structures used, the types of operations performed on the data structures, and the properties of the control strategies used. Principles of Artificial Intelligenceevolved from the author's courses and seminars at Stanford University and University of Massachusetts, Amherst, and is suitable for text use in a senior or graduate AI course, or for individual study. |
From inside the book
Results 6-10 of 31
... 8-puzzle example of Figure 1.1 where rules are selected according to the arbitrary scheme of first attempting to move the blank square left, then up, then right, then down. Backing up will occur (a) whenever we generate a state ...
... previous State (number ), So we retract the next-to the-last move also and apply “move blank down” to State . Continuation is in the next column. Fig. 1.3A backtracking control strategy applied to the 8-puzzle. 26 PRODUCTION SYSTEMS AND AI.
... 8-puzzle problem posed in Figure 1.1. We can keep track of the various rules applied and the databases produced by a structure called a search tree. An example of such a tree is in Figure 1.4. At the top or root of the tree is a ...
... : : : i : : : : : : * : . : : : : Z\ ^ - ZN A /\ ^ D: : Goal The processes required to represent problems initially and to improve. Fig. 1.4A search tree for the 8-puzzle. Fig. 1.6 A search tree for the traveling salesman problem.
... 8-puzzle might specify the 32 rules corresponding to: move tile 1 left, move tile 1 right, move tile 1 up, move tile 1 down, move tile 2 left, etc. Of course, most of these rules are never applicable to any given state description ...
Contents
1 | |
17 | |
53 | |
CHAPTER 3 SEARCH STRATEGIES FOR DECOMPOSABLE PRODUCTION SYSTEMS | 99 |
CHAPTER 4 THE PREDICATE CALCULUS IN AI | 131 |
CHAPTER 5 RESOLUTION REFUTATION SYSTEMS | 161 |
CHAPTER 6 RULEBASED DEDUCTION SYSTEMS | 193 |
CHAPTER 7 BASIC PLANGENERATING SYSTEMS | 275 |
CHAPTER 8 ADVANCED PLANGENERATING SYSTEMS | 321 |
CHAPTER 9 STRUCTURED OBJECT REPRESENTATIONS | 361 |
PROSPECTUS | 417 |
BIBLIOGRAPHY | 429 |
AUTHOR INDEX | 467 |
SUBJECT INDEX | 471 |