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 56
... Heuristic Graph-search Procedures 72 Related Algorithms 88 Measures of Performance 91 Bibliographical and Historical Remarks 94 Exercises 96 SEARCH STRATEGIES FOR DECOMPOSABLE PRODUCTION SYSTEMS 99 Searching AND/OR Graphs 99 AO*: A ...
... heuristic methods for searching the graphs that are implicitly defined by many AI systems. Chapter 3 generalizes these search techniques to extended versions of these graphs, called AND/OR graphs, and to the graphs that arise in ...
... heuristic applicability. In Figure 1.13 we show an AND/OR tree that illustrates a possible search performed by a decomposable production system. The problem is to integrate 4 | —-ax (1 - x2)” Algebraic substitutions Example x*dx ...
... heuristic graph searching is extensive; several references are cited in the next two chapters. 1.4.3, EXAMPLE PROBLEMS Problem-solving programs have sharpened their techniques on a variety of puzzles and games. Some good general books ...
... heuristic merit). 4 LOOP: if NULL(RULES), return FAIL; if there are no (more) rules to apply, the procedure fails. 5 R - FIRST(RULES); the best of the applicable rules is selected. 6 RULES - TAIL(RULES); the list of applicable rules is ...
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 |