Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 89
Página 48
... necessary for the problem's solution . Ignorable problems can be solved using a simple control structure that never backtracks . Such a control structure is easy to implement . Recoverable problems can be solved by a slightly more ...
... necessary for the problem's solution . Ignorable problems can be solved using a simple control structure that never backtracks . Such a control structure is easy to implement . Recoverable problems can be solved by a slightly more ...
Página 128
... necessary . An alternative approach is to make the assumption that the only things that change are the things that must . By " must " here we mean that the change is either required explicitly by the axioms that describe the operator or ...
... necessary . An alternative approach is to make the assumption that the only things that change are the things that must . By " must " here we mean that the change is either required explicitly by the axioms that describe the operator or ...
Página 426
... necessary to produce the correct parse . Expand the grammar of Figure 15.6 as necessary to do this . • John wanted to go to the movie with Sally . • John wanted to go to the movie with Robert Redford . ⚫ I heard the story listening to ...
... necessary to produce the correct parse . Expand the grammar of Figure 15.6 as necessary to do this . • John wanted to go to the movie with Sally . • John wanted to go to the movie with Robert Redford . ⚫ I heard the story listening to ...
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