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 82
... contain the following terminal symbols, of approves new president company sale the and the following non-terminal symbols, S NP VP PP P V DNP DET A N . The grammar is defined by the following rewrite rules: DNP VP – S V DNP -> VP P DNP ...
... containing the subsequence DNP VP to one in which this subsequence is replaced by S. A rule is not applicable if the database does not contain the left-hand side of the corresponding grammar rule. Also, a rule may be applicable to a ...
... contain only Ms. Agraph-search control regime might explore many equivalent paths in producing a database containing only Ms ... contains only Ms. AI production systems often have global databases that are decomposable in this manner ...
... contains merely the chemical formula; at intermediate stages, the database describes some of the structure of the compound; at the end of the process, the database contains a representation of the entire structure of the compound. We ...
... contains no unstructured formulas satisfies the termination condition. Briefly, we can illustrate how the structure-proposing rules work by a simple example. Let us suppose that we are given the chemical formula C; H12. Our production ...
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 |