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 31
Several of these problems ( including the traveling salesman problem ) are
members of a class that computational theorists call NP - complete .
Computational theorists rank the difficulty of various problems on how the worst
case for the time ...
The solution graph , then , represents a complete playing strategy . Grundy ' s
game , tic - tac - toe ( naughts and crosses ) , various versions of nim , and some
chess and checker end - games are examples of simple games in which AND /
In Al applications , complete strategies are not so important as ones that find
refutations efficiently . 5 . 2 . 1 . THE BREADTH - FIRST STRATEGY In the
breadth - first strategy , all of the first - level resolvents are computed first , then
the second ...
What people are saying - Write a review
PRODUCTION SYSTEMS AND AI
SEARCH STRATEGIES FOR
10 other sections not shown