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 1-5 of 74
... f © © © W / \ / \ f\ / \ \ / \ | \ ! \ / \ 6 / \ / \ / \ / \ | \ 1 \ / \ / \ / \ / \ / | W / % / \ / \ / \ / \ f ... rule is not applicable to a database unless it transforms it into some legal one. Thus the rule corresponding to “go to ...
... F-rules. If, instead, we choose to employ problem goal descriptions as the global database, we shall say that the ... rule or an applicable B-rule. 1.2. SPECIALIZED PRODUCTION SYSTEMS 1.2.1. COMMUTATIVE PRODUCTION SYSTEMS Under certain ...
... rule, called the factoring rule, allows us to replace the expression fk f(x) dx by the expression k[f(x) dx. Other rules are based on the processes shown in Figure 1.12. A-" |Cs H12] SS Rule Rule H H | | H - C - H |C2Hs! - |-le." | |C ...
... f(n2) > g(n1) + h (n1) = f(n1). Since this fact is true for any adjacent pair of nodes in the sequence of nodes ... rule is to enhance the chances that the first path discovered to a node will be an optimal path. Thus, even when the ...
You have reached your viewing limit for this book.
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 |