Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 80
Página 29
... Define the problem precisely . This definition must include precise specifications of what the initial situation ( s ) will be as well as what final situations constitute acceptable solutions to the problem . 2. Analyze the problem . A ...
... Define the problem precisely . This definition must include precise specifications of what the initial situation ( s ) will be as well as what final situations constitute acceptable solutions to the problem . 2. Analyze the problem . A ...
Página 199
... Defines the set of possible worlds that could exist given the facts that we do have . More precisely , we will define an interpretation of a set of wff's to be a domain ( a set of objects ) D , together with a function that assigns : to ...
... Defines the set of possible worlds that could exist given the facts that we do have . More precisely , we will define an interpretation of a set of wff's to be a domain ( a set of objects ) D , together with a function that assigns : to ...
Página 422
... define other speech acts similarly . For example , we can define ASK - WHAT ( in which A asks B the value of some predicate P ) : ASK - WHAT ( A , B , P ) : precondition : KNOW - WHAT ( A , LOCATION ( B ) ) KNOW - WHAT ( B , P ) WILLING ...
... define other speech acts similarly . For example , we can define ASK - WHAT ( in which A asks B the value of some predicate P ) : ASK - WHAT ( A , B , P ) : precondition : KNOW - WHAT ( A , LOCATION ( B ) ) KNOW - WHAT ( B , P ) WILLING ...
Contenido
5 | 24 |
Heuristic Search Techniques | 63 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 28 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 fact frame 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 operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG properties 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