Principles of Artificial Intelligence
A 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.
Results 1-3 of 79
... expression in AND / OR form consists of subexpressions of literals connected by ^ and V symbols . Note that an expression in AND / OR form is not in clause form . It is much closer to the form of the original expression . In particular ...
... expression produced by a backward application of an F - rule must certainly contain instances of the precon- ditions of that F - rule . But if the goal expression contains other literals ( besides L ) , then the subgoal expression must ...
... expression ON ( B , C ) through stack ( A , B ) yielding ON ( B , C ) . ( 2 ) Add the expressions HOLDING ( A ) ... expression is CLEAR ( A ) . Two F - rules have CLEAR on their add list . Let's consider unstack ( x , y ) . As a B - rule ...
PRODUCTION Systems and AI
SEARCH Strategies FOR
10 other sections not shown