Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 87
Página 270
... domain - independent slot attributes , slots may have domain- specific properties that support problem solving in a particular domain . Since these slots are not treated explicitly by the frame - system interpreter , they will be useful ...
... domain - independent slot attributes , slots may have domain- specific properties that support problem solving in a particular domain . Since these slots are not treated explicitly by the frame - system interpreter , they will be useful ...
Página 473
... domain theory is used to prune away all the unimportant aspects of the training example with respect to the goal concept . What is left is an explanation of why the training example is an instance of the goal concept . This explanation ...
... domain theory is used to prune away all the unimportant aspects of the training example with respect to the goal concept . What is left is an explanation of why the training example is an instance of the goal concept . This explanation ...
Página 547
... Domain Knowledge Expert systems are complex AI programs . Almost all the techniques that we described in Parts I and II have been exploited in at least one expert system . However , the most widely used way of representing domain ...
... Domain Knowledge Expert systems are complex AI programs . Almost all the techniques that we described in Parts I and II have been exploited in at least one expert system . However , the most widely used way of representing domain ...
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