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 89
... example, suppose the goal state is 1 2 3 74 86 5 and the initial state is 1 2 5 74 86 3 Any applicable rule applied to the initial state description lowers the value of our hill-climbing function. In this case the initial state ...
... example, let us apply the backtracking strategy to our 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 ...
... example of such a tree is in Figure 1.4. At the top or root of the tree is a description of the initial configuration. The various rules that can be applied correspond to links or directed arcs to descendant nodes, representing those ...
... example, an initial representation of the 8-puzzle might specify the 32 rules corresponding to: move tile 1 left ... example problems to illustrate how they might be represented for solution by a production system. 1.1.6. SOME EXAMPLE ...
... example, the grammar rule DNP VP → S is used to change any database containing the subsequence DNP VP to one in which this subsequence is replaced by S. A rule is not applicable if the database does not contain the left-hand side of ...
Contents
1 | |
17 | |
CHAPTER 2 SEARCH STRATEGIES FOR AI PRODUCTION SYSTEMS | 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 |