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 90
... applied and the databases produced by a structure called a search tree. An example of such a tree is in Figure 1.4. At the top or root of the tree is a description of the initial configuration. The various rules that can be applied ...
... applied to the state descriptions to produce new state descriptions, and these rules are called F-rules. If, instead, we choose to employ problem goal descriptions as the global database, we shall say that the system is a backward ...
... applying any pair in sequence, the three are still applicable. Furthermore, Figure 1.8 demonstrates that the same database, namely SG, is achieved regardless of the sequence of rules applied in the set (R1,R2, R3}. We say that a ...
... applying alternative sequences of rules. Applying an inappropriate rule delays, but never prevents, termination; after termination, extraneous rules can be removed from the solution sequence. We have occasion later to investigate ...
... applied. Consider, for example, a system whose initial database is (C, B, Z), whose production rules are based on the following rewrite rules, R1 : C → (D, L.) R2: C → (B, M) R3: B – (M, M) R4: Z-> (B, B, M) and whose termination ...
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 |