Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 21
Página 27
... draw from this hurried introduction to the major questions of AI ? The problems are varied , interesting , and hard . If we solve them , we will have useful programs and perhaps a better understanding of human thought . We should do the ...
... draw from this hurried introduction to the major questions of AI ? The problems are varied , interesting , and hard . If we solve them , we will have useful programs and perhaps a better understanding of human thought . We should do the ...
Página 54
... draw into the figure . To exploit such advice , the computer's reasoning must be analogous to that of its human advisor , at least on a few levels . As computers move into areas of great significance to human lives , such as medical ...
... draw into the figure . To exploit such advice , the computer's reasoning must be analogous to that of its human advisor , at least on a few levels . As computers move into areas of great significance to human lives , such as medical ...
Página 447
... drawn from the same population more efficiently and more effectively the next time . As thus defined , learning covers ... draw heavily on knowledge as their source of power . Knowledge is generally acquired through experience , and such ...
... drawn from the same population more efficiently and more effectively the next time . As thus defined , learning covers ... draw heavily on knowledge as their source of power . Knowledge is generally acquired through experience , and such ...
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