Principles of Artificial Intelligence
A 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.
Results 1-5 of 93
... Graph-search Strategies 61 Uninformed Graph-search Procedures 68 Heuristic Graph-search Procedures 72 Related Algorithms 88 Measures of Performance 91 Bibliographical and Historical Remarks 94 Exercises 96 SEARCH STRATEGIES FOR ...
... 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 that satisfies the termination ...
... and a graph-search control strategy that generates a search tree of global databases. Now consider another production system whose global database is the entire search tree of the first. The rules of the new production system represent ...
... 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 ...
CHAPTER 3 SEARCH STRATEGIES FOR DECOMPOSABLE PRODUCTION SYSTEMS
CHAPTER 4 THE PREDICATE CALCULUS IN AI
CHAPTER 5 RESOLUTION REFUTATION SYSTEMS
CHAPTER 6 RULEBASED DEDUCTION SYSTEMS
CHAPTER 7 BASIC PLANGENERATING SYSTEMS
CHAPTER 8 ADVANCED PLANGENERATING SYSTEMS
CHAPTER 9 STRUCTURED OBJECT REPRESENTATIONS