McGraw-Hill, 1991 - 621 páginas
The breadth of A. I. is explored and explained in this best selling text. Assuming no prior knowledge,it covers topics like neural networks and robotics. This text explores the range of problems which have been and remain to be solved using A. I. tools and techniques. The second half of this text is an excellent reference.
Resultados 1-3 de 51
Much of the early work in the field focused on formal tasks, such as game playing
and theorem proving. Samuel wrote ... It was able to prove several theorems from
the first chapter of Whitehead and Russell's Principia Mathematica. Gelernter's ...
Suppose we are trying to prove a mathematical theorem. We proceed by first
proving a lemma that we think will be useful. Eventually, we realize that the
lemma is no help at all. Are we in trouble? No. Everything we need to know to
prove the ...
Although the emphasis in that paper is on proving mathematical theorems, many
of the ideas in it can be applied to a ... For another discussion of theorem proving
using natural mechanisms, see Boyer and Moore , which describes a ...
Comentarios de la gente - Escribir un comentario
Calificaciones de los usuarios
very poor book for novice.Assumes u already know AI and the language is not at all user friendly.One has to read a sentence repeatedly to get a grasp and some times even then u don't understand.Go for other books much better than this
not soo good to go for novice
What Is Artificial Intelligence?
Problems Problem Spaces and Search
Heuristic Search Techniques
Derechos de autor
Otras 21 secciones no mostradas