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 455
... operators can be useful in such cases , since one macro - operator can produce a small global change in the world , even though the individual operators that make it up produce many undesirable local changes . For example , consider the ...
... operators can be useful in such cases , since one macro - operator can produce a small global change in the world , even though the individual operators that make it up produce many undesirable local changes . For example , consider 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
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