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-3 of 49
Page 40
... component is processed to completion before processing begins on the next . Of course , when a production rule is applied to a component , a database may result that can itself be split . The components of this database are processed in ...
... component is processed to completion before processing begins on the next . Of course , when a production rule is applied to a component , a database may result that can itself be split . The components of this database are processed in ...
Page 297
... component goal , ON ( B , C ) , would be harder to solve . There seems no way to solve this problem by selecting one component , solving it , and then solving the other compo- nent without undoing the solution to the first . We say that ...
... component goal , ON ( B , C ) , would be harder to solve . There seems no way to solve this problem by selecting one component , solving it , and then solving the other compo- nent without undoing the solution to the first . We say that ...
Page 298
... component goals in the order in which they appear on the stack . When all of the component goals are solved , it reconsiders the compound goal again , re - listing the components on the top of the stack if the compound goal does not ...
... component goals in the order in which they appear on the stack . When all of the component goals are solved , it reconsiders the compound goal again , re - listing the components on the top of the stack if the compound goal does not ...
Contents
PROLOGUE | 1 |
PRODUCTION SYSTEMS AND AI | 17 |
SEARCH STRATEGIES FOR | 53 |
Copyright | |
10 other sections not shown
Other editions - View all
Common terms and phrases
8-puzzle achieve actions Adders AI production 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 CONT(Y,A contains control regime control strategy cost Deleters delineation depth-first search described discussed disjunction domain element-of evaluation function example existentially quantified F-rule formula frame problem global database goal expression goal node goal stack goal wff graph-search HANDEMPTY heuristic HOLDING(A implication initial state description knowledge literal nodes logic monotone restriction natural language processing negation node labeled ONTABLE(A optimal path pickup(A precondition predicate calculus problem-solving procedure production system proof prove recursive regress represent representation resolution refutation result robot problem rule applications search graph search tree selected 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 universally quantified unstack(C,A variables WORKS-IN