Artificial Intelligence |
Dentro del libro
Resultados 1-3 de 87
Página 48
Backtracking will be necessary to recover from such mistakes , so the control
structure must be implemented using a push - down stack , in which decisions
are recorded in case they need to be undone later . Irrecoverable problems , on
the ...
Backtracking will be necessary to recover from such mistakes , so the control
structure must be implemented using a push - down stack , in which decisions
are recorded in case they need to be undone later . Irrecoverable problems , on
the ...
Página 128
Unfortunately , in any complex domain , a huge number of these axioms
becomes necessary . An alternative approach is to make the assumption that the
only things that change are the things that must . By “ must ” here we mean that
the ...
Unfortunately , in any complex domain , a huge number of these axioms
becomes necessary . An alternative approach is to make the assumption that the
only things that change are the things that must . By “ must ” here we mean that
the ...
Página 435
Although these approaches differ considerably , there is one modification to a
simple , single agent view of reasoning that is necessary to support all of them in
anything other than a trivial way . We need a way to represent models of agents ...
Although these approaches differ considerably , there is one modification to a
simple , single agent view of reasoning that is necessary to support all of them in
anything other than a trivial way . We need a way to represent models of agents ...
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