Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 86
Página 32
... problem statement . We have assumed that we can fill a jug from the pump , that we can pour water out of a jug onto the ground , that we can pour water from one jug to another , and that there are ... PROBLEMS , PROBLEM SPACES , AND SEARCH.
... problem statement . We have assumed that we can fill a jug from the pump , that we can pour water out of a jug onto the ground , that we can pour water from one jug to another , and that there are ... PROBLEMS , PROBLEM SPACES , AND SEARCH.
Página 35
... 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 simpler problems ...
... 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 simpler problems ...
Página 45
... Problem Decomposable ? Suppose we want to solve the problem of computing the expression + 3x + sin x cos2x ) dx We can solve this problem by breaking it down into three smaller problems , each of which we can then solve by using a small ...
... Problem Decomposable ? Suppose we want to solve the problem of computing the expression + 3x + sin x cos2x ) dx We can solve this problem by breaking it down into three smaller problems , each of which we can then solve by using a small ...
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