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 17
Page 289
... regress HANDEMPTY through this F - rule instance , we would obtain F. ( The literal HANDEMPTY can never be true immediately after applying unstack . ) If we were to regress ON- TABLE ( C ) , we would obtain ONTABLE ( C ) . ( The literal ...
... regress HANDEMPTY through this F - rule instance , we would obtain F. ( The literal HANDEMPTY can never be true immediately after applying unstack . ) If we were to regress ON- TABLE ( C ) , we would obtain ONTABLE ( C ) . ( The literal ...
Page 290
... regress an expression matching an incompletely instantiated literal in the delete list . Suppose , for example that we want to regress CLEAR ( C ) through unstack ( x , B ) . If x were equal to C , then CLEAR ( C ) would regress to F ...
... regress an expression matching an incompletely instantiated literal in the delete list . Suppose , for example that we want to regress CLEAR ( C ) through unstack ( x , B ) . If x were equal to C , then CLEAR ( C ) would regress to F ...
Page 347
... regress through a strict sequence ( as in this last example ) , the process is straightforward , but how are conditions to be regressed through a partial ordering ? Some conditions may regress through to conditions that match Adders : 1 ...
... regress through a strict sequence ( as in this last example ) , the process is straightforward , but how are conditions to be regressed through a partial ordering ? Some conditions may regress through to conditions that match Adders : 1 ...
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
achieve actions algorithm AND/OR graph answer applied arcs Artificial Intelligence assume attempt backtracking backward block called chapter clause CLEAR CLEAR(C complete component condition consider consistent contains control strategy corresponding cost database deduction Deleters described direction discussed evaluation example expression F-rule fact Figure formula function given goal goal node goal stack goal wff HANDEMPTY heuristic important initial involves JOHN knowledge labeled language literals logic match methods move namely node Note obtained occur ONTABLE(A operation path possible precondition predicate calculus problem procedure production system proof prove quantified reasoning refutation represent representation resolution result robot rule satisfied selected sequence shown in Figure simple solution graph solve specify statement step STRIPS structure subgoal substitutions successors Suppose symbols termination theorem unifying unit University variables