Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 64
Página 347
... operators for attaining the first goal , followed by a complete sequence for the second goal , etc. But as we have seen , difficult problems cause goal interactions . The operators used to solve one subproblem may interfere with the ...
... operators for attaining the first goal , followed by a complete sequence for the second goal , etc. But as we have seen , difficult problems cause goal interactions . The operators used to solve one subproblem may interfere with the ...
Página 355
... operators , in which larger operators were built from smaller ones [ Fikes and Nilsson , 1971 ] . But in this approach , no details were eliminated from the actual descriptions of the operators . A better approach was developed in the ...
... operators , in which larger operators were built from smaller ones [ Fikes and Nilsson , 1971 ] . But in this approach , no details were eliminated from the actual descriptions of the operators . A better approach was developed in the ...
Página 456
... operators . This approach contrasts with STRIPS , which learned its MACROPS gradually , from experience . Korf's algorithm runs in time proportional to the time it takes to solve a single problem without macro - operators . 17.4.3 ...
... operators . This approach contrasts with STRIPS , which learned its MACROPS gradually , from experience . Korf's algorithm runs in time proportional to the time it takes to solve a single problem without macro - operators . 17.4.3 ...
Contenido
5 | 24 |
Heuristic Search Techniques | 63 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 28 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 fact frame 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 operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG properties 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