Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 32
Página 38
... backtracking is called chronological backtracking because the order in which steps are undone depends only on the temporal sequence in which the steps were originally made . Specifically , the most recent step is always the first to be ...
... backtracking is called chronological backtracking because the order in which steps are undone depends only on the temporal sequence in which the steps were originally made . Specifically , the most recent step is always the first to be ...
Página 212
... backtracking , one that is based on logical dependencies rather than the chronological order in which decisions were made . We call this new method dependency - directed backtracking [ Stallman and Sussman , 1977 ] , in contrast to ...
... backtracking , one that is based on logical dependencies rather than the chronological order in which decisions were made . We call this new method dependency - directed backtracking [ Stallman and Sussman , 1977 ] , in contrast to ...
Página 389
... backtrack to try some other path . There are two important drawbacks to this approach . The first is that a good deal of time may be wasted saving state descriptions at each choice point , even though backtracking will occur to only a ...
... backtrack to try some other path . There are two important drawbacks to this approach . The first is that a good deal of time may be wasted saving state descriptions at each choice point , even though backtracking will occur to only a ...
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