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 63
Page viii
... Backward Deduction System 212 " Resolving " Within AND / OR Graphs 234 Computation Deductions and Program Synthesis 241 6.5 . A Combination Forward and Backward System 253 6.7 . CHAPTER 7 : 7.1 . 7.2 . 6.6 . Control Knowledge For Rule ...
... Backward Deduction System 212 " Resolving " Within AND / OR Graphs 234 Computation Deductions and Program Synthesis 241 6.5 . A Combination Forward and Backward System 253 6.7 . CHAPTER 7 : 7.1 . 7.2 . 6.6 . Control Knowledge For Rule ...
Page 32
... BACKWARD AND BIDIRECTIONAL PRODUCTION SYSTEMS We might say that our production system for solving the 8 - puzzle worked forward from the initial state to a goal state . Thus , we could call it a forward production system . We could also ...
... BACKWARD AND BIDIRECTIONAL PRODUCTION SYSTEMS We might say that our production system for solving the 8 - puzzle worked forward from the initial state to a goal state . Thus , we could call it a forward production system . We could also ...
Page 33
... backward direction , by starting at the goal state , applying inverse moves , and working toward the initial state ... backward - directed production system in the case of the 8 - puzzle is simple because the goal is described by ...
... backward direction , by starting at the goal state , applying inverse moves , and working toward the initial state ... backward - directed production system in the case of the 8 - puzzle is simple because the goal is described by ...
Page 34
... backward direction , it is often convenient to make this distinction explicit . When a problem has intuitively clear states and goals and when we choose to employ descriptions of these states as the global database of a production ...
... backward direction , it is often convenient to make this distinction explicit . When a problem has intuitively clear states and goals and when we choose to employ descriptions of these states as the global database of a production ...
Page 47
... backward direction . They might be controlled by irrevocable or tentative control regimes . The taxonomy of production systems based on these distinctions will help greatly in organizing various Al systems and concepts into a coherent ...
... backward direction . They might be controlled by irrevocable or tentative control regimes . The taxonomy of production systems based on these distinctions will help greatly in organizing various Al systems and concepts into a coherent ...
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 |
Other editions - View all
Common terms and phrases
8-puzzle achieve actions Adders algorithm AND/OR graph applied Artificial Intelligence atomic formula backed-up value backtracking backward block breadth-first breadth-first search called chapter clause form CLEAR(C component contains control regime control strategy cost DCOMP Deleters delineation depth-first search described discussed disjunction domain element-of evaluation function example existentially quantified F-rule formula frame problem game tree global database goal expression goal node goal stack goal wff graph-search HANDEMPTY heuristic HOLDING(A implication initial state description knowledge leaf nodes literal nodes logic methods monotone restriction negation node labeled ONTABLE(A optimal path pickup(A precondition predicate calculus problem-solving procedure production rules production system proof prove recursive regress represent representation resolution refutation result robot problem rule applications search graph search tree semantic network sequence shown in Figure Skolem function solution graph solve stack(A STRIPS structure subgoal substitutions successors Suppose symbols termination condition theorem theorem-proving tip nodes unifying composition universally quantified