Artificial Intelligence |
Dentro del libro
Resultados 1-3 de 85
Página 206
Consider a knowledge base that consists of just a single statement : A ( Joe ) V B
( Joe ) The CWA allows us to conclude both - A ( Joe ) and B ( Joe ) , since
neither A nor B must necessarily be true of Joe . Unfortunately , the resulting
extended ...
Consider a knowledge base that consists of just a single statement : A ( Joe ) V B
( Joe ) The CWA allows us to conclude both - A ( Joe ) and B ( Joe ) , since
neither A nor B must necessarily be true of Joe . Unfortunately , the resulting
extended ...
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 ...
Página 445
Node labeling in the distributed truth maintenance system works similarly to node
labeling in a single - agent system except that we need to redefine consistency .
Rather than insisting on global consistency , we instead insist on extended local
...
Node labeling in the distributed truth maintenance system works similarly to node
labeling in a single - agent system except that we need to redefine consistency .
Rather than insisting on global consistency , we instead insist on extended local
...
Comentarios de la gente - Escribir un comentario
No encontramos ningún comentario en los lugares habituales.
Contenido
What Is Artificial Intelligence? | 3 |
Problems Problem Spaces and Search | 29 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 21 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 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