Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 85
Página 35
... solve the problem , producing such a specification is itself a very hard problem . Although our ultimate goal is to be able to solve difficult , unstructured problems , such as natural language understanding , it is useful to explore ...
... solve the problem , producing such a specification is itself a very hard problem . Although our ultimate goal is to be able to solve difficult , unstructured problems , such as natural language understanding , it is useful to explore ...
Página 448
... problem solving . The advice may need to be first operationalized , a process explored in Section 17.3 . People also learn through their own problem - solving experience . After solving a complex problem , we remember the structure of the ...
... problem solving . The advice may need to be first operationalized , a process explored in Section 17.3 . People also learn through their own problem - solving experience . After solving a complex problem , we remember the structure of the ...
Página 456
... Problems like choosing which subgoals to tackle and which operators to try ( i.e. , search control problems ) are solved with the same mechanisms as problems in the original problem space . Because the problem solving is uniform ...
... Problems like choosing which subgoals to tackle and which operators to try ( i.e. , search control problems ) are solved with the same mechanisms as problems in the original problem space . Because the problem solving is uniform ...
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