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 43
Page 17
... global database that is manipulated by certain well - defined operations , all under the control of some global control strategy . We stress the importance of identifying an appropriate level of description ; near the machine - code ...
... global database that is manipulated by certain well - defined operations , all under the control of some global control strategy . We stress the importance of identifying an appropriate level of description ; near the machine - code ...
Page 18
... global database . If the precondition is satisfied , the rule can be applied . Application of the rule changes the database . The control system chooses which applicable rule should be applied and ceases computation when a ...
... global database . If the precondition is satisfied , the rule can be applied . Application of the rule changes the database . The control system chooses which applicable rule should be applied and ceases computation when a ...
Page 19
... global database of a production system . For the 8 - puzzle , a straightforward description is a 3 × 3 array or matrix of numbers . The initial global database is this description of the initial problem state . Virtually any kind of ...
... global database of a production system . For the 8 - puzzle , a straightforward description is a 3 × 3 array or matrix of numbers . The initial global database is this description of the initial problem state . Virtually any kind of ...
Page 30
... global database shall be a list of the cities visited so far . Thus the initial database is described by the list ( A ) . We do not allow lists that name any city more than once , except that after all of the other cities have been ...
... global database shall be a list of the cities visited so far . Thus the initial database is described by the list ( A ) . We do not allow lists that name any city more than once , except that after all of the other cities have been ...
Page 32
... global database shall consist of a string of symbols . The initial database is the given string of symbols that we want to test . The production rules are derived from the rewrite rules of the grammar . The right - hand side of a ...
... global database shall consist of a string of symbols . The initial database is the given string of symbols that we want to test . The production rules are derived from the rewrite rules of the grammar . The right - hand side of a ...
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