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 81
Page 35
... applying any pair in sequence , the three are still applicable . Furthermore , Figure 1.8 demonstrates that the same database , namely SG , is achieved regardless of the sequence of rules applied in the set { R1 , R2 , R3 } . We say ...
... applying any pair in sequence , the three are still applicable . Furthermore , Figure 1.8 demonstrates that the same database , namely SG , is achieved regardless of the sequence of rules applied in the set { R1 , R2 , R3 } . We say ...
Page 278
... applied . The second component of the F - rule is a list of literals ( possibly containing free variables ) called the delete list . When an F - rule is applied to a state description , the match substitution is applied to the literals ...
... applied . The second component of the F - rule is a list of literals ( possibly containing free variables ) called the delete list . When an F - rule is applied to a state description , the match substitution is applied to the literals ...
Page 323
... applied , and the condition just under the marker , namely , CLEAR ( B ) , must now be tested . ( For clarity , we include next to our goal stacks a picture of the state produced by applying the F - rules above the marker . ) When the ...
... applied , and the condition just under the marker , namely , CLEAR ( B ) , must now be tested . ( For clarity , we include next to our goal stacks a picture of the state produced by applying the F - rules above the marker . ) When the ...
Contents
PROLOGUE | 1 |
PRODUCTION SYSTEMS AND AI | 17 |
SEARCH STRATEGIES FOR | 53 |
Copyright | |
12 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 global database goal 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