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 60
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 second , and so on . To test
each argument pair , we can simply call the unification procedure recursively .
2 Matching with Variables The problem of selecting applicable rules is made
more difficult when preconditions are not stated ... It often turns out that
discovering whether there is a match between a particular situation and the
preconditions of a ...
For more details about the RETE match algorithm , see Forgy [ 1982 ] . Other
matching algorithms ( e . g . , Miranker ( 1987 ) and Oflazer ( 1987 ] ) take
different stands on how much time to spend on saving state information between
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
Heuristic Search Techniques
Knowledge Representation Issues
Derechos de autor
Otras 14 secciones no mostradas