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 31
... condition forms the basis for the termination condition of the production system. The control strategy repeatedly applies rules to state descriptions until a description of a goal state is produced. It also keeps track of the rules that ...
... termination condition, do: 3 begin 4 select some rule, R, in the set of rules that can be 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 ...
... termination condition. Applying hill-climbing to the 8-puzzle we might use, as a function of the state description, the negative of the number of tiles “out of place,” as compared to the goal state description. For example, the value of ...
... termination condition. In Figure 1.4, we show all applicable rules being applied to every state description. This sort of indecision on the part of the control system is usually grossly inefficient because the resulting tree grows too ...
... termination condition. Notice that we can use the. Fig. 1.6 A search tree for the traveling salesman problem. Fig. 1.8 Equivalent paths in a graph. Fig. 1.9 Solution. 30 PRODUCTION SYSTEMS AND AI.
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 |