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 11-15 of 43
... selection made in step 5 be a backtracking point? Discuss. If step 5 is not a backtracking point, are there any differences between procedure SPLIT under backtracking and procedure PRODUCTION under backtracking? CHAPTER 2 SEARCH ...
... selection is made completely arbitrarily, without regard to any information about the problem at hand. For example, an applicable rule could be selected completely at random. At the informed extreme, the control strategy is guided by ...
... selection, exploring a surface for a maximum, and the backtracking and graphsearch regimes, search processes that permitted tentative rule selection. Our main concern in the present chapter is tentative control. Fig. 2. 1 Computational ...
... selected. 6 RULES - TAIL(RULES); the list of applicable rules is diminished by removing the one just selected. 7 RDATA – R(DATA); rule R is applied to produce a new database. 8 PATH – BACKTRACK(RDATA); BACKTRACK is called recursively on ...
... selected for expansion. The nodes on CLOSED are either tip nodes selected for expansion that generated no successors in the search graph or nontip nodes of the search tree. The procedure orders the nodes on OPEN in step 8 so that the ...
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 |