Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 78
Página 35
... possible to automate this process , it must be done by hand , however . For simple problems , such as chess or the ... possible configurations of the relevant objects ( and perhaps some impossible ones ) . It is , of course , possible to ...
... possible to automate this process , it must be done by hand , however . For simple problems , such as chess or the ... possible configurations of the relevant objects ( and perhaps some impossible ones ) . It is , of course , possible to ...
Página 331
... possible outcomes of each step , then we can simply traverse the paths that turn out to be appropriate . But often there are a great many possible outcomes , most of which are highly unlikely . In such situations , it would be a great ...
... possible outcomes of each step , then we can simply traverse the paths that turn out to be appropriate . But often there are a great many possible outcomes , most of which are highly unlikely . In such situations , it would be a great ...
Página 435
... possible for each agent to build a model of both itself and the other agents with which it must interact . The self - descriptive model is necessary to enable the agent to know when it should get help from others and to allow it to ...
... possible for each agent to build a model of both itself and the other agents with which it must interact . The self - descriptive model is necessary to enable the agent to know when it should get help from others and to allow it to ...
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