Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 83
Página 44
... solution steps be ignored or at least undone if they prove unwise ? • Is the problem's universe predictable ? Is a good solution to the problem obvious without comparison to all other possible solutions ? • Is the desired solution a ...
... solution steps be ignored or at least undone if they prove unwise ? • Is the problem's universe predictable ? Is a good solution to the problem obvious without comparison to all other possible solutions ? • Is the desired solution a ...
Página 64
... solution by comparing the chosen point or the endpoint of the chosen path to the set of acceptable goal states . 3. If a solution has been found , quit . Otherwise , return to step 1 . If the generation of possible solutions is done ...
... solution by comparing the chosen point or the endpoint of the chosen path to the set of acceptable goal states . 3. If a solution has been found , quit . Otherwise , return to step 1 . If the generation of possible solutions is done ...
Página 90
... solution consistent with all the known constraints . If the contradiction involves only those constraints that were given as part of the problem specification ( as opposed to ones that were guessed during problem solving ) , then no ...
... solution consistent with all the known constraints . If the contradiction involves only those constraints that were given as part of the problem specification ( as opposed to ones that were guessed during problem solving ) , then no ...
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