A revised web site should be up shortly, detailing what's new. Here's what the preface says:<p>This edition captures the changes in AI that have taken place since
the last edition in 2003. There have been important applications of
AI technology, such as the widespread deployment of practical speech
recognition, machine translation, autonomous vehicles, and household
robotics. There have been algorithmic landmarks, such as the solution
of the game of checkers. And there has been a great deal of
theoretical progress, particularly in areas such as probabilistic
reasoning, machine learning, and computer vision. Most important
from our point of view is the continued evolution in how we think about the field, and thus how we
organize the book. The major changes are as follows:
\begin{itemize}
\item We place more emphasis on partially observable and nondeterministic
environments, especially in the nonprobabilistic settings of search
and planning. The concepts of {\em belief state} (a set of possible
worlds) and {\em state estimation} (maintaining the belief state)
are introduced in these settings; later in the book, we add probabilities.
\item In addition to discussing the types of environments and types of agents,
we now cover in more depth the types of {\em representations} that an agent can use.
We distinguish among {\em atomic} representations (in which each state of the
world is treated as a black box), {\em factored} representations (in which a state is
a set of attribute/value pairs), and {\em structured} representations (in which the world
consists of objects and relations between them).
\item Our coverage of planning goes into more depth on contingent planning in partially observable
environments and includes a new approach to hierarchical planning.
\item We have added new material on first-order probabilistic models,
including {\em open-universe} models for cases where there is
uncertainty as to what objects exist.
\item We have completely rewritten the introductory machine-learning chapter, stressing a wider varie\
ty
of more modern learning algorithms and placing them on a firmer theoretical footing.
\item We have expanded coverage of Web search and information
extraction, and of techniques for learning from very large data sets.
\item 20\% of the citations in this edition are to works published after
2003.
\item We estimate that about 20\%
of the material is brand new. The remaining 80\% reflects older work but has been largely
rewritten to present a more unified picture of the field.
\end{itemize}
Ah very nice, the chess position shown on the cover appears to be the final position from game 6 of the 1997 Kasparov vs. Deep Blue match.<p><a href="http://www.amazon.com/gp/product/images/0136042597/ref=dp_image_0?ie=UTF8&n=283155&s=books" rel="nofollow">http://www.amazon.com/gp/product/images/0136042597/ref=dp_im...</a><p><a href="http://en.wikipedia.org/wiki/Deep_Blue_%E2%80%93_Kasparov,_1997,_Game_6" rel="nofollow">http://en.wikipedia.org/wiki/Deep_Blue_%E2%80%93_Kasparov,_1...</a>
If anyone is looking for a good reference to one of AI's subtopics--Machine Learning--then I highly recommend Christopher Bishop's Pattern Recognition and Machine Learning.<p>I believe the book was published in 2006, so a vast majority of the material is cutting edge. It's a difficult read, and not really meant for the duct tape programmer. But if you have the patience to stick with this book for as long as I have (an entire year), then you'll be well positioned to tackle any problem in Artificial Intelligence.