Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 86
Página 73
... applying an appropriate heuristic function to each of them . We then expand the chosen node by using the rules to generate its ... applied to them . Now another path , that going through node B , looks more promising , so it is pursued ...
... applying an appropriate heuristic function to each of them . We then expand the chosen node by using the rules to generate its ... applied to them . Now another path , that going through node B , looks more promising , so it is pursued ...
Página 75
... applying each of the rules that were applied along the best path to the node . The function h ' is an estimate of the additional cost of getting from the current node to a goal state . This is the place where knowledge about the problem ...
... applying each of the rules that were applied along the best path to the node . The function h ' is an estimate of the additional cost of getting from the current node to a goal state . This is the place where knowledge about the problem ...
Página 182
... applied , and so forth , until a solution is found . We have suggested that clever search involves choosing from among the rules that can be applied at a particular point , the ones that are most likely to lead to a solution . But we ...
... applied , and so forth , until a solution is found . We have suggested that clever search involves choosing from among the rules that can be applied at a particular point , the ones that are most likely to lead to a solution . But we ...
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