Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 80
Página 12
... look at several parts of the board at once , whereas the conventional computer must look at the squares one at a time . Sometimes an investigation of how people solve problems sheds great light on how computers should do so . At other ...
... look at several parts of the board at once , whereas the conventional computer must look at the squares one at a time . Sometimes an investigation of how people solve problems sheds great light on how computers should do so . At other ...
Página 73
... looks more promising , so it is pursued , generating nodes G and H. But again when these new nodes are evaluated they look less promising than another path , so attention is returned to the path through D to E. E is then expanded ...
... looks more promising , so it is pursued , generating nodes G and H. But again when these new nodes are evaluated they look less promising than another path , so attention is returned to the path through D to E. E is then expanded ...
Página 548
... look like this : If : the most current active context is distributing massbus devices , and there is a single - port disk drive that has not been assigned to a massbus , and there are no unassigned dual - port disk drives , and the ...
... look like this : If : the most current active context is distributing massbus devices , and there is a single - port disk drive that has not been assigned to a massbus , and there are no unassigned dual - port disk drives , and the ...
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