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 6-10 of 91
... graph. For example, the database (M, M) occurs as four nodes in Figure 1.10, and these could have been collapsed into one.) A solution to this rewriting problem can be illustrated by a subgraph of the AND/OR graph. Such a solution ...
... and Waterman (1977)]. A paper by Davis and King (1977) thoroughly discusses production systems in AI. Our notion of a production system involves no restrictions on the form of the glooal database, the rules, or ... graph methods are given in ...
... and R2, say, are applicable; suppose the control system selects and applies ... or DB3. In order to achieve this sort of flexibility, a control system must keep an explicit record of a ... GRAPH-SEARCH STRATEGIES 2.2. Graph-search Strategies.
... or tree. Because these databases are usually very large structures, it would ... and records of incremental changes from which any of the other ... graph and search tree before expanding node. 62 SEARCH STRATEGIES FOR AI PRODUCTION SYSTEMS.
... and node n, is an ancestor of node n, We see that the problem of finding a sequence of rules transforming one database into another is equivalent to the problem of finding a path in a graph ... or implicitly. In an explicit specification, 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 |