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 11-15 of 31
... termination conditions are called decomposable. The basic procedure for a decomposable production system might look ... condition, do: 4 begin 5 select D* from among those {Di} that do not satisfy the termination condition 6 remove D ...
... termination, the database resulting from just one of the rule applications must be processed to termination. In Figure 1.10, any node corresponding to a component database satisfying the termination condition (in this case consisting of ...
... 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 system proposes some candidate structures for ...
... termination condition and are enclosed in double boxes. The darkened arcs indicate a solution tree for this problem. From this solution tree and from the integrals obtained from the integral table, we compute the answer: - l • - arCS1n ...
... termination condition for a production system to solve the missionaries and cannibals problem: Three missionaries and three cannibals come to a river. There 50 PRODUCTION SYSTEMS AND AI Exercises.
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 |