Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 85
Página 299
... usually possible to separate the two facets cleanly . However , as we have seen in the last few chapters , knowledge representation systems can play the role of support systems that underly specific problem - solving programs . The ...
... usually possible to separate the two facets cleanly . However , as we have seen in the last few chapters , knowledge representation systems can play the role of support systems that underly specific problem - solving programs . The ...
Página 435
... usually called multi - agent planning . The first step , problem decomposition , is essentially the same as it is ... usually handled at plan creation time . In a multiple agent sys- tem , it is not usually possible to do that , since ...
... usually called multi - agent planning . The first step , problem decomposition , is essentially the same as it is ... usually handled at plan creation time . In a multiple agent sys- tem , it is not usually possible to do that , since ...
Página 549
... usually written primarily as rule - based systems , forward chaining , backward chaining , or some combination of the two , is usually used . For example , MYCIN used backward chaining to discover what organisms were present ; then it ...
... usually written primarily as rule - based systems , forward chaining , backward chaining , or some combination of the two , is usually used . For example , MYCIN used backward chaining to discover what organisms were present ; then it ...
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