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