Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 10
Página 336
... ARMEMPTY D : ON ( x , y ) ^ ARMEMPTY A : HOLDING ( x ) ^ CLEAR ( y ) P : CLEAR ( x ) ^ ONTABLE ( x ) ^ ARMEMPTY D : ONTABLE ( x ) ^ ARMEMPTY A : HOLDING ( x ) PUTDOWN ( x ) P : HOLDING ( x ) D : HOLDING ( x ) A : ONTABLE ( x ) ...
... ARMEMPTY D : ON ( x , y ) ^ ARMEMPTY A : HOLDING ( x ) ^ CLEAR ( y ) P : CLEAR ( x ) ^ ONTABLE ( x ) ^ ARMEMPTY D : ONTABLE ( x ) ^ ARMEMPTY A : HOLDING ( x ) PUTDOWN ( x ) P : HOLDING ( x ) D : HOLDING ( x ) A : ONTABLE ( x ) ...
Página 345
... ARMEMPTY A B C goal : ON ( A , B ) ^ ON ( B , C ) Figure 13.5 : A Slightly Harder Blocks Problem ON ( C , A ) CLEAR ( C ) ARMEMPTY ON ( C , A ) ^ CLEAR ( C ) ^ ARMEMPTY UNSTACK ( C , A ) ARMEMPTY CLEAR ( A ) ^ ARMEMPTY PICKUP ( A ) ...
... ARMEMPTY A B C goal : ON ( A , B ) ^ ON ( B , C ) Figure 13.5 : A Slightly Harder Blocks Problem ON ( C , A ) CLEAR ( C ) ARMEMPTY ON ( C , A ) ^ CLEAR ( C ) ^ ARMEMPTY UNSTACK ( C , A ) ARMEMPTY CLEAR ( A ) ^ ARMEMPTY PICKUP ( A ) ...
Página 350
... ARMEMPTY HOLDING ( A ) ¬ARMEMPTY HOLDING ( B ) Adding these PICKUP steps is not enough to satisfy the * HOLDING preconditions of the STACK steps . This is because there are no ordering constraints present among the steps . If , in the ...
... ARMEMPTY HOLDING ( A ) ¬ARMEMPTY HOLDING ( B ) Adding these PICKUP steps is not enough to satisfy the * HOLDING preconditions of the STACK steps . This is because there are no ordering constraints present among the steps . If , in the ...
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