Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 80
Página 340
... goal stack is simply ON ( C , A ) Ʌ ON ( B , D ) Ʌ ONTABLE ( A ) A ONTABLE ( D ) But we want to separate this problem into four subproblems , one for each component of the original goal . Two of the subproblems , ONTABLE ( A ) and ...
... goal stack is simply ON ( C , A ) Ʌ ON ( B , D ) Ʌ ONTABLE ( A ) A ONTABLE ( D ) But we want to separate this problem into four subproblems , one for each component of the original goal . Two of the subproblems , ONTABLE ( A ) and ...
Página 342
Elaine Rich. This time , when we compare the top element of the goal stack , ON ( B , A ) , to the world model , we see that it is satisfied . So we pop it off and consider the next goal , CLEAR ( B ) . It , too , is already true in the ...
Elaine Rich. This time , when we compare the top element of the goal stack , ON ( B , A ) , to the world model , we see that it is satisfied . So we pop it off and consider the next goal , CLEAR ( B ) . It , too , is already true in the ...
Página 347
... goal - stack planning method attacks problems involving conjoined goals by solving the goals one at a time , in order . A plan generated by this method contains a sequence of operators for attaining the first goal , followed by a ...
... goal - stack planning method attacks problems involving conjoined goals by solving the goals one at a time , in order . A plan generated by this method contains a sequence of operators for attaining the first goal , followed by 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