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 30
Page 195
... clause 1 , say , and using it and its descendants in resolutions . We can ... form . If we look at our original goal , namely , to prove P ^ ( QV R ) , it ... form close to their original given form . Wffs representing assertional ...
... clause 1 , say , and using it and its descendants in resolutions . We can ... form . If we look at our original goal , namely , to prove P ^ ( QV R ) , it ... form close to their original given form . Wffs representing assertional ...
Page 201
... clause form of the fact expression . ) We intend that the graph resulting after rule application represent both the ... clause form of F ( W ) . This set of clauses includes the entire set that would be produced by performing all ...
... clause form of the fact expression . ) We intend that the graph resulting after rule application represent both the ... clause form of F ( W ) . This set of clauses includes the entire set that would be produced by performing all ...
Page 212
... clause form , and added to the clause form of the assertions . Duality between assertions and goals allows the negated goal to be treated as if it were an assertion . Resolution refutation systems apply resolution to the combined set of ...
... clause form , and added to the clause form of the assertions . Duality between assertions and goals allows the negated goal to be treated as if it were an assertion . Resolution refutation systems apply resolution to the combined set of ...
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