Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 11
Página 342
... ARMEMPTY , and it is also true in the current world model , so it can be popped off the stack . The next element on ... ARMEMPTY ONTABLE ( C ) A CLEAR ( C ) A ARMEMPTY PICKUP ( C ) CLEAR ( A ) A HOLDING ( C ) STACK ( C , A ) ON ( B , D ) ...
... ARMEMPTY , and it is also true in the current world model , so it can be popped off the stack . The next element on ... ARMEMPTY ONTABLE ( C ) A CLEAR ( C ) A ARMEMPTY PICKUP ( C ) CLEAR ( A ) A HOLDING ( C ) STACK ( C , A ) ON ( B , D ) ...
Página 345
... ARMEMPTY A B C goal : ON ( A , B ) A 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 ) A 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 PICKUP ( B ) ¬ONTABLE ( B ) ¬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 ...
... ARMEMPTY PICKUP ( B ) ¬ONTABLE ( B ) ¬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 ...
Contenido
5 | 24 |
Heuristic Search Techniques | 63 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 28 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott agents algorithm answer apply approach ARMEMPTY assertions attributes axioms backpropagation backtracking backward belief best-first search breadth-first search Caesar called Chapter chess clauses complete concept conceptual dependency consider constraints contains contradiction corresponding define depth-first depth-first search described discussed domain fact frame function game tree goal grammar graph heuristic Horn clauses important inference inheritance input instance interpretation isa links John justification knowledge base knowledge representation labeled learning Marcus match minimax move MYCIN natural language node object ON(B operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG properties represent result robot rules script Section semantic semantic net sentence shown in Figure simple slot solution solve specific step structure Suppose syntactic task techniques theorem things tree truth maintenance system understanding variables version space