Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 35
Página 215
... Justification an alibi , then we should erase from the database the belief that Abbott is a suspect . But suppose ... justification . Each justification consists of two parts : an IN - list and an OUT - list . In the figure , the ...
... Justification an alibi , then we should erase from the database the belief that Abbott is a suspect . But suppose ... justification . Each justification consists of two parts : an IN - list and an OUT - list . In the figure , the ...
Página 216
... Justification structure are met . The first criterion is consistency : every node labeled IN is supported by at least one valid justification and all other nodes are labeled OUT . More specifically than before , a justification is valid ...
... Justification structure are met . The first criterion is consistency : every node labeled IN is supported by at least one valid justification and all other nodes are labeled OUT . More specifically than before , a justification is valid ...
Página 217
... justification and is labeled OUT . That Abbott was on the register of a far away hotel and the lack of belief that the register was forged will cause the appropriate forward rule to fire and create a justification for Alibi Abbott ...
... justification and is labeled OUT . That Abbott was on the register of a far away hotel and the lack of belief that the register was forged will cause the appropriate forward rule to fire and create a justification for Alibi Abbott ...
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