Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 93
Página 203
... reasoning . We call this specific form abductive reasoning . More precisely , the process of abductive reasoning can be described as , “ Given two wff's ( A → B ) and ( B ) , for any expressions A and B , if it is consistent to assume ...
... reasoning . We call this specific form abductive reasoning . More precisely , the process of abductive reasoning can be described as , “ Given two wff's ( A → B ) and ( B ) , for any expressions A and B , if it is consistent to assume ...
Página 209
... reasoning systems that support this kind of reasoning allow standard forward- chaining rules to be augmented with unless clauses , which introduce a basis for reasoning by default . Control ( including deciding which default ...
... reasoning systems that support this kind of reasoning allow standard forward- chaining rules to be augmented with unless clauses , which introduce a basis for reasoning by default . Control ( including deciding which default ...
Página 433
... Reasoning Systems In all of our discussions of problem - solving systems until now , we have focused on the design of single systems . In this section , we expand our view , and look at ... REASONING SYSTEMS 433 Distributed Reasoning Systems.
... Reasoning Systems In all of our discussions of problem - solving systems until now , we have focused on the design of single systems . In this section , we expand our view , and look at ... REASONING SYSTEMS 433 Distributed Reasoning Systems.
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