Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas A revision of an established text for undergraduate and postgraduate Artificial Intelligence courses, this text incorporates the latest research and methods. |
Dentro del libro
Resultados 1-3 de 79
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 424
... PERFORM ( B , R ) ) BELIEVE ( A , CAN - PERFORM ( B , R ) ) BELIEVE ( A , WILLING - TO - PERFORM ( B , R ) ) BELIEVE ( A , ¬WILL ( PERFORM ( B , R ) ) ) If we assume that each participant in a dialogue is following these conventions ...
... PERFORM ( B , R ) ) BELIEVE ( A , CAN - PERFORM ( B , R ) ) BELIEVE ( A , WILLING - TO - PERFORM ( B , R ) ) BELIEVE ( A , ¬WILL ( PERFORM ( B , R ) ) ) If we assume that each participant in a dialogue is following these conventions ...
Contenido
What Is Artificial Intelligence? | 3 |
5 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 25 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott agents algorithm answer apply approach ARMEMPTY assertions attributes axioms backpropagation backtracking backward belief best-first search breadth-first search Caesar called Chapter chess clauses complete concept conceptual dependency consider constraints contains contradiction corresponding define depth-first depth-first search described discussed domain example fact function game tree goal grammar graph heuristic Horn clauses important inference inheritance input instance interpretation isa links John justification knowledge base knowledge representation labeled learning Marcus match minimax move MYCIN natural language node object ON(B ON(C operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG represent result robot rules script Section semantic semantic net sentence shown in Figure simple slot solution solve specific step structure Suppose syntactic task techniques theorem things tree truth maintenance system understanding variables version space