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 91
... and Historical Remarks 10 PRODUCTION SYSTEMS AND AI 17 Production Systems 17 ... Graph-search Strategies 61 Uninformed Graph-search Procedures 68 Heuristic ... OR Graphs 99 AO*: A Heuristic Search Procedure for AND/OR Graphs 103 Some ...
... and another rule is selected instead. Formally, the backtracking strategy can be used regardless of how much or how ... Graph Search. Graphs (or more specially, trees) are extremely useful structures for keeping track of the effects of ...
... and the databases produced by a structure called a search tree. An example of such a tree is in Figure 1.4. At the top or ... graph-search control strategy grows such a tree until a database is produced ... graph-search control regimes, it is ...
... or undone. Any rule that was applicable to an earlier database is still ... and a graph-search control strategy that generates a search tree of global ... graph. Fig. 1.9 Solution sequences for a rewriting problem. Fig. 1.11. 36 PRODUCTION ...
... AND/OR tree for our rewrite problem in Figure 1.10. Just as with ordinary graphs, an AND/OR graph consists of nodes labeled by global databases. Nodes labeled by compound databases have sets of successor nodes each labeled by one of 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 |