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 42
... statement is , of course , independent of the many equivalent predicate calculus forms that could represent it . But the way in which English statements are worded often carries extra - logical , or heuristic , control information . In ...
... statement ; for example , GOAL ( ANIMAL ? x ) . This statement is equivalent to the predicate calculus goal expression ( 3x ) ANIMAL ( x ) . The variable x with a ? prefix is existentially quantified when it occurs in GOAL statements ...
... statement to be executed , and the bindings that apply for a sequence of statements are shown at the top of the sequence . The next statement encountered ( after binding variables ) is : GOAL ( WORKS - IN ? x ? u ) . Here we have a ...
PRODUCTION SYSTEMS AND AI
SEARCH STRATEGIES FOR
10 other sections not shown