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 89
Page 3
... representing contextual knowledge and certain techniques for making inferences from that knowledge . Although we do ... represented in the subject domain database . Common knowledge ( typically omitted in the subject domain ...
... representing contextual knowledge and certain techniques for making inferences from that knowledge . Although we do ... represented in the subject domain database . Common knowledge ( typically omitted in the subject domain ...
Page 4
... represented and used is one of the system design problems that invites the methods of Artificial Intelligence ... represent and use the knowledge that human experts in these subjects obviously possess and use . This problem is ...
... represented and used is one of the system design problems that invites the methods of Artificial Intelligence ... represent and use the knowledge that human experts in these subjects obviously possess and use . This problem is ...
Page 8
... represent the scene by some appropriate model . This model might consist of a high - level description such as " A hill with a tree on top with cattle grazing . " The point of the whole perception process is to produce a condensed ...
... represent the scene by some appropriate model . This model might consist of a high - level description such as " A hill with a tree on top with cattle grazing . " The point of the whole perception process is to produce a condensed ...
Page 19
... represent a problem . Selecting a good representation is one of the important arts involved in applying Al techniques to practical problems . For the 8 - puzzle and certain other problems , we can easily identify elements of the problem ...
... represent a problem . Selecting a good representation is one of the important arts involved in applying Al techniques to practical problems . For the 8 - puzzle and certain other problems , we can easily identify elements of the problem ...
Page 27
... representing those states that can be reached by just one move from the initial state . A graph - search control ... represented appropriately , have trivially small state spaces . Sometimes a given state space can be collapsed by ...
... representing those states that can be reached by just one move from the initial state . A graph - search control ... represented appropriately , have trivially small state spaces . Sometimes a given state space can be collapsed by ...
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