Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas A revision of an established text for undergraduate and postgraduate Artificial Intelligence courses, this text incorporates the latest research and methods. |
Dentro del libro
Resultados 1-3 de 88
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 ( x2 + 3x + sin2x · cos2x ) dx J2 We can solve this problem by breaking it down into three smaller problems , each of which we can then solve by ...
... Problem Decomposable ? Suppose we want to solve the problem of computing the expression ( x2 + 3x + sin2x · cos2x ) dx J2 We can solve this problem by breaking it down into three smaller problems , each of which we can then solve by ...
Contenido
What Is Artificial Intelligence? | 3 |
5 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 25 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott agents algorithm answer apply approach ARMEMPTY assertions attributes axioms backpropagation backtracking backward belief best-first search breadth-first search Caesar called Chapter chess clauses complete concept conceptual dependency consider constraints contains contradiction corresponding define depth-first depth-first search described discussed domain example fact function game tree goal grammar graph heuristic Horn clauses important inference inheritance input instance interpretation isa links John justification knowledge base knowledge representation labeled learning Marcus match minimax move MYCIN natural language node object ON(B ON(C operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG represent result robot rules script Section semantic semantic net sentence shown in Figure simple slot solution solve specific step structure Suppose syntactic task techniques theorem things tree truth maintenance system understanding variables version space