Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 87
Página 184
... apply in the current cycle . RETE maintains a network of rule conditions , and it uses changes in the state description to determine which new rules might apply ( and which rules might no longer apply ) . Full matching is only pursued ...
... apply in the current cycle . RETE maintains a network of rule conditions , and it uses changes in the state description to determine which new rules might apply ( and which rules might no longer apply ) . Full matching is only pursued ...
Página 190
... apply in a given situation , and what effects those rules will have . 4. All intermediate and final results of problem solving are remembered ( or , chunked ) for future reference.4 The third feature is of most interest to us here ...
... apply in a given situation , and what effects those rules will have . 4. All intermediate and final results of problem solving are remembered ( or , chunked ) for future reference.4 The third feature is of most interest to us here ...
Página 202
... apply the first assertion , which allows us to conclude -Pacifist ( Dick ) . Having done that , the second assertion cannot apply , since it is not consistent to assume Pacifist ( Dick ) . The other thing we could do , however , is apply ...
... apply the first assertion , which allows us to conclude -Pacifist ( Dick ) . Having done that , the second assertion cannot apply , since it is not consistent to assume Pacifist ( Dick ) . The other thing we could do , however , is apply ...
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