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
... successor nodes each labeled by one of the components . These successor nodes are called AND nodes because in order to process the compound database to termination , all of the component databases must be processed to termination . Sets ...
... successor nodes labeled by the results of rule applications . These successor nodes are called OR nodes because in order to process a component database to termination , the database resulting from just one of the rule applications must ...
... successor of node n1 , and node n , is said to be a parent of node nj . In the graphs that are of interest to us ... successors of each other ; in this case the pair of directed arcs is sometimes replaced by an edge . DBI RI R2 DB2 ...
... successors is called a tip node . We say that the root node is of depth zero . The depth of any other node in the tree is defined to be the depth of its parent plus 1 . −1 A sequence of nodes ( ni , ni2 , ... , nik ) , with each ni , a ...
... successors of that node ( and the costs of the associated arcs ) . We call this process of applying the successor operator to a node , expanding the node . The successor operator depends in an obvious way on the rules . Expanding s ...
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 |