Artificial Intelligence |
Dentro del libro
Resultados 1-3 de 37
Página 87
Until INIT is labeled SOLVED or until INIT ' s h ' value becomes greater than
FUTILITY , repeat the following procedure : ( a ) Trace the labeled arcs from INIT
and select for expansion one of the as yet unexpanded nodes that occurs on this
...
Until INIT is labeled SOLVED or until INIT ' s h ' value becomes greater than
FUTILITY , repeat the following procedure : ( a ) Trace the labeled arcs from INIT
and select for expansion one of the as yet unexpanded nodes that occurs on this
...
Página 216
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 justification is valid if every node in its IN - list is labeled IN and
every ...
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 justification is valid if every node in its IN - list is labeled IN and
every ...
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 ...
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