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 1-5 of 20
... first attempting to move the blank square left, then up, then right, then down. Backing up will occur (a) whenever ... depth bound of this backtracking process. In Figure 1.3 we show a sequence of tentative rule applications and backups ...
... depth-first graph-search) control strategies should be used when there are multiple paths between problem states because these strategies tend to avoid exploring all of the paths. 1.9 In using a backtracking strategy with procedure ...
... FIRST(RULES); the best of the applicable rules is selected. 6 RULES - TAIL(RULES); the list of applicable rules is diminished by removing the one just selected. 7 ... depth exceeds this bound. 56 SEARCH STRATEGIES FOR AI PRODUCTION SYSTEMS.
... search orders the nodes on OPEN in descending order of their depth in the search tree. The deepest nodes are put first in the list. Nodes of equal depth are ordered arbitrarily. The search that results from such an ordering is called depth- ...
... depth-first procedure generates new databases in an order similar to that generated by an uninformed backtracking control strategy. The correspondence would be exact if the graph-search process generated only one successor at a time ...
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 |