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 54
The problem of finding a proof for ( Ex ) W ( x ) from S is an ordinary predicate
calculus theoremproving problem , but producing the satisfying instance for x
requires that the proof method be “ constructive . ” We note that the prospect of ...
In our example , these steps produce the proof tree shown in Figure 5 . 7 with the
clause AT ( FIDO , SCHOOL ) at the root . This clause , then , is the appropriate
answer to the problem . We note that the answer statement has a form similar to ...
The constant A could have been a variable without invalidating the proof shown
in Figure 5 . 12 . It can be shown ( Luckham and Nilsson ( 1971 ) ] that in the
answer - extracting process it is correct to replace any Skolem functions in the ...
What people are saying - Write a review
PRODUCTION SYSTEMS AND AI
SEARCH STRATEGIES FOR
10 other sections not shown