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 85
Página 184
... apply in the current cycle . RETE maintains a network of rule conditions , and it uses changes in the state description to determine which new rules might apply ( and which rules might no longer apply ) . Full matching is only pursued ...
... apply in the current cycle . RETE maintains a network of rule conditions , and it uses changes in the state description to determine which new rules might apply ( and which rules might no longer apply ) . Full matching is only pursued ...
Página 190
... apply in a given situation , and what effects those rules will have . 4. All intermediate and final results of problem solving are remembered ( or , chunked ) for future reference.4 The third feature is of most interest to us here ...
... apply in a given situation , and what effects those rules will have . 4. All intermediate and final results of problem solving are remembered ( or , chunked ) for future reference.4 The third feature is of most interest to us here ...
Página 202
... apply the first assertion , which allows us to conclude ¬Pacifist ( Dick ) . Having done that , the second assertion cannot apply , since it is not consistent to assume Pacifist ( Dick ) . The other thing we could do , however , is apply ...
... apply the first assertion , which allows us to conclude ¬Pacifist ( Dick ) . Having done that , the second assertion cannot apply , since it is not consistent to assume Pacifist ( Dick ) . The other thing we could do , however , is apply ...
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