Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 78
Página 463
... Example of the Concept Car set of possible descriptions and evolving that set as new examples and near misses are presented . As in the previous section , we need some sort of representation language for examples so that we can describe ...
... Example of the Concept Car set of possible descriptions and evolving that set as new examples and near misses are presented . As in the previous section , we need some sort of representation language for examples so that we can describe ...
Página 468
... example . Now we come to the third example , a positive one . The first order of business is to remove from the G set any descriptions that are inconsistent with the positive example . Our new G set is : G = { ( x1 , x2 , Blue , X4 , X5 ) ...
... example . Now we come to the third example , a positive one . The first order of business is to remove from the G set any descriptions that are inconsistent with the positive example . Our new G set is : G = { ( x1 , x2 , Blue , X4 , X5 ) ...
Página 473
... 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 is expressed in terms that satisfy the operationality criterion . The next step ...
... 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 is expressed in terms that satisfy the operationality criterion . The next step ...
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