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 29
Page xii
... selected exercises as a basis for class discussion . Pertinent references are briefly discussed at the end of every chapter . These citations should provide the interested student with adequate entry points to much of the most important ...
... selected exercises as a basis for class discussion . Pertinent references are briefly discussed at the end of every chapter . These citations should provide the interested student with adequate entry points to much of the most important ...
Page 8
... selected instead of the countless others that might have been used ? The strategy of making hypotheses about various levels of description and then testing these hypotheses seems to offer an approach to this problem . Systems have been ...
... selected instead of the countless others that might have been used ? The strategy of making hypotheses about various levels of description and then testing these hypotheses seems to offer an approach to this problem . Systems have been ...
Page 21
... selected in step 4 has a good chance of being the most appropriate one . We distinguish two major kinds of control strategies : irrevocable and tentative . In an irrevocable control regime , an applicable rule is selected and applied ...
... selected in step 4 has a good chance of being the most appropriate one . We distinguish two major kinds of control strategies : irrevocable and tentative . In an irrevocable control regime , an applicable rule is selected and applied ...
Page 22
Nils J. Nilsson. when a rule is selected . Should subsequent computation encounter difficulty in producing a solution , the state of the computation reverts to the previous backtracking point , where another rule is applied instead , and ...
Nils J. Nilsson. when a rule is selected . Should subsequent computation encounter difficulty in producing a solution , the state of the computation reverts to the previous backtracking point , where another rule is applied instead , and ...
Page 23
... selected ( arbitrarily ) that does not diminish the value . If there are no such rules , the process halts . ( -4 ) ( -3 ) ( -3 ). 283. 283. 2 3 7. 164. 5. 1 4. 184. 765. 765. 0. 123. 8 4 765 ( -1 ) -2. 123. 23. 84. 184. 765 765 For the ...
... selected ( arbitrarily ) that does not diminish the value . If there are no such rules , the process halts . ( -4 ) ( -3 ) ( -3 ). 283. 283. 2 3 7. 164. 5. 1 4. 184. 765. 765. 0. 123. 8 4 765 ( -1 ) -2. 123. 23. 84. 184. 765 765 For the ...
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