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 26
Page 153
... conjunction of several such formulas can serve as a description of a particular situation or " world state . " We call it a state description . Actually , any finite conjunction of formulas really describes a family of different world ...
... conjunction of several such formulas can serve as a description of a particular situation or " world state . " We call it a state description . Actually , any finite conjunction of formulas really describes a family of different world ...
Page 181
... conjunction [ B ( x ) ^ C ( x ) ] ; nevertheless , we treat this conjunction as a single literal and proceed formally as if the formula were a clause ( none of the elements of this conjunction are ever in any unification sets ) ...
... conjunction [ B ( x ) ^ C ( x ) ] ; nevertheless , we treat this conjunction as a single literal and proceed formally as if the formula were a clause ( none of the elements of this conjunction are ever in any unification sets ) ...
Page 277
... conjunction of literals . Variables in these precondi- tion formulas are assumed to have existential quantification . To decide whether or not a conjunction of literals ( the precondition formula ) logically follows from another ...
... conjunction of literals . Variables in these precondi- tion formulas are assumed to have existential quantification . To decide whether or not a conjunction of literals ( the precondition formula ) logically follows from another ...
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