Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 82
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 353
... step addition , promotion , declobbering , simple establishment , or separation . 4. Review all the steps in the plan , including any new steps introduced by step addition , to see if any of their preconditions are unachieved . Add to S ...
... step addition , promotion , declobbering , simple establishment , or separation . 4. Review all the steps in the plan , including any new steps introduced by step addition , to see if any of their preconditions are unachieved . Add to S ...
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