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 9
This set is called the deleters of Cij . Any deleter of Cuj might ( as an F - rule )
destroy this precondition for F - rule j ; thus the order in which deleters occur
relative to F - rule j is important . If the deleter is a descendant of rule j in the
graph , we ...
ON ( CB ) ^ ON ( A , C ) a O join ON ( C , B ) ON ( A , C ) Adders : Adders : 3 stack
( C . B . 1 ) stack ( A . C . 2 ) / 3 CLEAR ( B ) CLEAR ( C ) HOLDING ( C , 1 )
Adders : 2 HOLDING ( A , 2 ) Adders : 4 Adders : 1 Deleters : 2 , 5 unstack ...
... ( C ) Deleters : 3 Adders : 4 Deleters : 5 75 pickup ( B ) ONTABLE ( B ) CLEAR (
B ) HANDEMPTY Deleters : 1 Adders : 1 Deleters : 2 , 3 pickup ( A ) Adders : 3
ONTABLE ( A ) CLEAR ( A ) | HANDEMPTY Adders : 4 Deleters : 3 , 5 unstack (
CA ) ...
What people are saying - Write a review
PRODUCTION SYSTEMS AND AI
SEARCH STRATEGIES FOR
10 other sections not shown