Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 70
Página 160
... addition to the resolution rule : Substitution of one value for another to which it is equal . • Reduction of computable predicates . If the predicate evaluates to FALSE , it can simply be dropped , since adding V FALSE to a disjunction ...
... addition to the resolution rule : Substitution of one value for another to which it is equal . • Reduction of computable predicates . If the predicate evaluates to FALSE , it can simply be dropped , since adding V FALSE to a disjunction ...
Página 349
... addition , and it is one of the heuristics we will use in generating nonlinear plans . Step addition is a very basic method dating back to GPS [ Newell and Simon , 1963 ] , where means- ends analysis was used to pick operators with ...
... addition , and it is one of the heuristics we will use in generating nonlinear plans . Step addition is a very basic method dating back to GPS [ Newell and Simon , 1963 ] , where means- ends analysis was used to pick operators with ...
Página 353
... 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 the ...
... 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 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