Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 74
Página 349
Elaine Rich. 1. Step Addition - Creating new steps for a plan . 2. Promotion - Constraining one step to come before another in a final plan . 3. Declobbering - Placing one ( possibly new ) step s2 between two old steps s1 and $ 3 , such ...
Elaine Rich. 1. Step Addition - Creating new steps for a plan . 2. Promotion - Constraining one step to come before another in a final plan . 3. Declobbering - Placing one ( possibly new ) step s2 between two old steps s1 and $ 3 , such ...
Página 350
... steps , then the * HOLDING preconditions would need to be satisfied by some other set of steps . We solve this problem by introducing ordering constraints whenever we employ step addition . In this case , we want to say that each PICKUP ...
... steps , then the * HOLDING preconditions would need to be satisfied by some other set of steps . We solve this problem by introducing ordering constraints whenever we employ step addition . In this case , we want to say that each PICKUP ...
Página 352
... step is the most problematic because we must always check if the new step clobbers some precondition of a later , already existing step . This has actually happened in our example . The step PICKUP ( B ) requires ARMEMPTY , but this is ...
... step is the most problematic because we must always check if the new step clobbers some precondition of a later , already existing step . This has actually happened in our example . The step PICKUP ( B ) requires ARMEMPTY , but this is ...
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