Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 86
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
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