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 43
... global database shall consist of a string of symbols. The initial database is the given string of symbols that we want to test. The production rules are derived from the rewrite rules of the grammar. The right-hand side of a grammar ...
... global database of a production system, we say that the system is a forward production system. Rules are applied to the state descriptions to produce new state descriptions, and these rules are called F-rules. If, instead, we choose to ...
... global database, rules that can modify it, 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 ...
... global database and rule set and in a simpler sort of control regime (irrevocable). This change in representation simply shifts the system description to a lower level. 1.2.2. DECOMPOSABLE PRODUCTION SYSTEMS Commutativity is not the ...
... global database used to establish the precondition of the rule. Since some of the rules are being applied essentially in parallel, their order is unimportant. In order to decompose a database, we must also be able to decompose 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 |