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 90
... applied to DATA 5 DATA - result of applying R to DATA 6 end 1.1.3. CONTROL The above procedure is nondeterministic because we have not yet specified precisely how we are going to select an applicable rule in statement 4. Selecting rules ...
... applied instead, and the process continues. In the second type of tentative control regime, which we call graph-search control, provision is made for keeping track of the effects of several sequences of rules simultaneously. Various ...
... applied to the initial state description lowers the value of our hill-climbing function. In this case the initial ... applying rules irrevocably. We shall see some examples of this possibility later. 1.1.4.2. Backtracking. In many ...
... applied an arbitrarily set number of rules without having generated a goal state description, or (c) whenever there are no (more) applicable rules. In (b) above, the number chosen is the depth bound of this backtracking process. In ...
... applied six rules without reaching a goal, SO, etc. This state occurs on the path back to the initial state, so we retract the last move and apply “move blank right” to state instead. Continuation is in the next column. Again, this ...
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 |