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 Intelligence"evolved 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 37
In one case , a parent node labeled by a compound database has a set of AND
successor nodes , each labeling one of the component databases . In the other
case , a parent node labeled by a component database has a set of OR
This expression , in turn , corresponds to the solution graph terminating in the
literal nodes labeled by R ( A ) and Q ( x ) . If the same rule is applied more than
once , it is important that each application use renamed variables . Otherwise ,
Such a B - rule is applicable to an AND / OR graph representing a goal wff if that
graph contains a literal node labeled by L ' that unifies with L . The result of
applying the rule is to add a match arc from the node labeled by L ' to a new ...
What people are saying - Write a review
PRODUCTION SYSTEMS AND AI
SEARCH STRATEGIES FOR
10 other sections not shown