Artificial Intelligence |
Dentro del libro
Resultados 1-3 de 88
Página 76
The basic idea of this algorithm is simple . Unfortunately , it is rarely the case that
graph traversal algorithms are simple to write correctly . And it is even rarer that it
is simple to guarantee the correctness of such algorithms . In the section that ...
The basic idea of this algorithm is simple . Unfortunately , it is rarely the case that
graph traversal algorithms are simple to write correctly . And it is even rarer that it
is simple to guarantee the correctness of such algorithms . In the section that ...
Página 86
2 The AO * Algorithm The problem reduction algorithm we just described is a
simplification of an algorithm described in Martelli and Montanari ( 1973 ) ,
Martelli and Montanari ( 1978 ) , and Nilsson ( 1980 ] . Nilsson calls it the AO *
algorithm ...
2 The AO * Algorithm The problem reduction algorithm we just described is a
simplification of an algorithm described in Martelli and Montanari ( 1973 ) ,
Martelli and Montanari ( 1978 ) , and Nilsson ( 1980 ] . Nilsson calls it the AO *
algorithm ...
Página 271
5 Inheritance Revisited In Chapter 4 , we presented a simple algorithm for
inheritance . But that algorithm assumed that the isa hierarchy was a tree . This is
often not the case . To support flexible representations of knowledge about the
world ...
5 Inheritance Revisited In Chapter 4 , we presented a simple algorithm for
inheritance . But that algorithm assumed that the isa hierarchy was a tree . This is
often not the case . To support flexible representations of knowledge about the
world ...
Comentarios de la gente - Escribir un comentario
Crítica de los usuarios - Marcar como inadecuado
very good
Contenido
Problems Problem Spaces and Search | 29 |
7 | 61 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 11 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
active addition agents algorithm allow answer apply approach assertions becomes belief build called Chapter choose clauses combined complete concept consider consistent constraints contains corresponding define dependency described discussed domain elements example fact Figure function given goal heuristic important initial input instance interpretation John kinds knowledge knowledge base labeled language learning logic look match meaning methods move natural necessary node object occur operators output particular path perform position possible predicate present problem procedure produce properties question reasoning relation represent representation result robot rules semantic sentence shown in Figure shows simple single situation slot solution solve space specific statements step stored structure Suppose task techniques things tree true understanding units usually variables weights