Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 76
Página 221
... performed by a JTMS : ⚫ consistent labeling ⚫ contradiction resolution We have also described a set of important reasoning operations that a JTMS does not perform , including : ⚫ applying rules to derive conclusions ⚫ creating ...
... performed by a JTMS : ⚫ consistent labeling ⚫ contradiction resolution We have also described a set of important reasoning operations that a JTMS does not perform , including : ⚫ applying rules to derive conclusions ⚫ creating ...
Página 422
... PERFORM ( B , INFORM ( B , A , P ) ) postcondition : KNOW - WHAT ( A , P ) This is the action that John could have performed as an alternative way of finding a screwdriver . We can also define other speech acts , such as A REQUEST B to ...
... PERFORM ( B , INFORM ( B , A , P ) ) postcondition : KNOW - WHAT ( A , P ) This is the action that John could have performed as an alternative way of finding a screwdriver . We can also define other speech acts , such as A REQUEST B to ...
Página 435
... PERFORM , and WILLING - TO - PERFORM ) to model writers and speakers , we use them to model agents in a distributed system . Using such operators , it is possible for each agent to build a model of both itself and the other agents with ...
... PERFORM , and WILLING - TO - PERFORM ) to model writers and speakers , we use them to model agents in a distributed system . Using such operators , it is possible for each agent to build a model of both itself and the other agents with ...
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