Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 50
Página 201
... consistent " means . Because consistency in this system , as in first - order predicate logic , is undecidable , we need some approximation . The one that is usually used is the PROLOG notion of negation as failure , or some variant of ...
... consistent " means . Because consistency in this system , as in first - order predicate logic , is undecidable , we need some approximation . The one that is usually used is the PROLOG notion of negation as failure , or some variant of ...
Página 202
... consistent to assume Pacifist ( Dick ) . The other thing we could do , however , is apply the second assertion first . This results in the conclusion Pacifist ( Dick ) , which prevents the first one from applying . So what conclusion ...
... consistent to assume Pacifist ( Dick ) . The other thing we could do , however , is apply the second assertion first . This results in the conclusion Pacifist ( Dick ) , which prevents the first one from applying . So what conclusion ...
Página 222
... consistent as- sumptions . As reasoning proceeds in an ATMS - based system , the universe of consistent contexts is pruned as contradictions are discovered . The remaining consistent contexts are used to label assertions , thus ...
... consistent as- sumptions . As reasoning proceeds in an ATMS - based system , the universe of consistent contexts is pruned as contradictions are discovered . The remaining consistent contexts are used to label assertions , thus ...
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