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 62
For example, the two literals tryassassinate(Marcus , Caesar) hate(Marcus,
Caesar) cannot be unified. If the predicate symbols match, then we must check
the arguments, one pair at a time. If the first matches, we can continue with the
It often turns out that discovering whether there is a match between a particular
situation and the preconditions of a given rule must itself involve a significant
search process. If we want to match a single condition against a single element in
For more details about the RETE match algorithm, see Forgy . Other
matching algorithms (e.g., Miranker [ 1 987] and Oflazer [ 1 987]) take different
stands on how much time to spend on saving state information between cycles.
They can ...
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