Artificial Intelligence |
Dentro del libro
Resultados 1-3 de 35
Página 216
6 : Labeled Nodes with Premise Justification structure are met . The first criterion
is consistency : every node labeled IN is supported by at least one valid
justification and all other nodes are labeled OUT . More specifically than before ,
a ...
6 : Labeled Nodes with Premise Justification structure are met . The first criterion
is consistency : every node labeled IN is supported by at least one valid
justification and all other nodes are labeled OUT . More specifically than before ,
a ...
Página 218
8 : Babbitt ' s Justification then that node must be labeled OUT if the labeling is to
be well - founded . The TMS task of ensuring a consistent , well - founded
labeling has now been outlined . The other major task of a TMS is resolving ...
8 : Babbitt ' s Justification then that node must be labeled OUT if the labeling is to
be well - founded . The TMS task of ensuring a consistent , well - founded
labeling has now been outlined . The other major task of a TMS is resolving ...
Página 373
So any labelings for either of the two vertices that require the line to be labeled in
a way that is inconsistent with the other vertex ... New constraints will arise from
this labeling and these constraints can be propagated back to vertices that have ...
So any labelings for either of the two vertices that require the line to be labeled in
a way that is inconsistent with the other vertex ... New constraints will arise from
this labeling and these constraints can be propagated back to vertices that have ...
Comentarios de la gente - Escribir un comentario
Crítica de los usuarios - Marcar como inadecuado
very good
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 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