Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 38
Página 77
... propagate down to a node , see if its parent points to the node we are coming from . If so , continue the propagation . If not , then its g value already reflects the better path of which it is part . So the propagation may stop here ...
... propagate down to a node , see if its parent points to the node we are coming from . If so , continue the propagation . If not , then its g value already reflects the better path of which it is part . So the propagation may stop here ...
Página 89
... Propagation can then occur with this new constraint , and so forth . The first step , propagation , arises from the fact that there are usually dependencies among the constraints . These dependencies occur because many constraints ...
... Propagation can then occur with this new constraint , and so forth . The first step , propagation , arises from the fact that there are usually dependencies among the constraints . These dependencies occur because many constraints ...
Página 90
... propagation terminates for one of two reasons . First , a contradiction may be detected . If this happens , then there is no solution consistent with all the known constraints . If the contradiction involves only those constraints that ...
... propagation terminates for one of two reasons . First , a contradiction may be detected . If this happens , then there is no solution consistent with all the known constraints . If the contradiction involves only those constraints that ...
Contenido
Weak SlotandFiller Structures | 9 |
6 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 24 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott algorithm answer apply approach Artificial Intelligence assertions attributes axioms backpropagation backtracking backward backward reasoning belief best-first search breadth-first search Cabot Caesar Chapter clauses concept consider constraints contains contexts contradiction corresponding define depth-first depth-first search described discussed domain example explicitly fact given goal graph heuristic heuristic function Horn clauses important inference inheritance input instance interpretation justification knowledge base knowledge representation labeled learning logical assertions Marcus match move MYCIN node nonmonotonic reasoning object operators particular path perceptron possible preconditions predicate logic problem problem-solving procedure produce production system PROLOG propagation propositional logic question represent resolution result robot rules Section semantic semantic net sentence shown in Figure simple slot solution solve space specific statements step strategy structure Suppose suspect syntactic task techniques theorem things tree true truth maintenance system variables wff's