Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 20
Página 73
... branch is explored . But eventually , if a solution is not found , that branch will start to look less promising than one of the top - level branches that had been ignored . At that point , the now more promising , previously ignored branch ...
... branch is explored . But eventually , if a solution is not found , that branch will start to look less promising than one of the top - level branches that had been ignored . At that point , the now more promising , previously ignored branch ...
Página 212
... branch in the search space . If that branch eventually dies out , then we know that at least one guess that led to it must be wrong . It could be any guess along the branch . In chronological backtracking we have to assume it was the ...
... branch in the search space . If that branch eventually dies out , then we know that at least one guess that led to it must be wrong . It could be any guess along the branch . In chronological backtracking we have to assume it was the ...
Página 274
... branch of the search . ( b ) If no value is found but there are instance or isa links upward , follow them . ( c ) Otherwise , terminate the branch . 3. For each element C of CANDIDATES do : ( a ) See if there is any other element of ...
... branch of the search . ( b ) If no value is found but there are instance or isa links upward , follow them . ( c ) Otherwise , terminate the branch . 3. For each element C of CANDIDATES do : ( a ) See if there is any other element of ...
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