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 51
Página 288
... sequences of events , as represented in scripts , can be useful in interpreting a particular , observed sequence of events . The usefulness of a script in some of these examples , such as the one in which unobserved events were ...
... sequences of events , as represented in scripts , can be useful in interpreting a particular , observed sequence of events . The usefulness of a script in some of these examples , such as the one in which unobserved events were ...
Página 337
... sequence of operators . But what happens during the process of searching for the correct operator sequence ? If one incorrect sequence is explored , it must be possible to return to the original state so that a different one can be ...
... sequence of operators . But what happens during the process of searching for the correct operator sequence ? If one incorrect sequence is explored , it must be possible to return to the original state so that a different one can be ...
Página 338
... sequence of operators that transforms the initial problem state into the goal state . How will it know when this has ... sequence of operators that might solve the problem must be proposed . This sequence can then be tested in the same ...
... sequence of operators that transforms the initial problem state into the goal state . How will it know when this has ... sequence of operators that might solve the problem must be proposed . This sequence can then be tested in the same ...
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