Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 27
Página 349
... precondition of $ 3 that was negated ( or " clobbered " ) by $ 1 . 4. Simple Establishment — Assigning a value to a variable , in order to ensure the preconditions of some step . 5. Separation Preventing the assignment of certain values ...
... precondition of $ 3 that was negated ( or " clobbered " ) by $ 1 . 4. Simple Establishment — Assigning a value to a variable , in order to ensure the preconditions of some step . 5. Separation Preventing the assignment of certain values ...
Página 350
... preconditions of the STACK steps . This is because there are no ordering constraints present among the steps . If , in the eventual plan , the PICKUP steps were to follow the STACK steps , then the * HOLDING preconditions would need to ...
... preconditions of the STACK steps . This is because there are no ordering constraints present among the steps . If , in the eventual plan , the PICKUP steps were to follow the STACK steps , then the * HOLDING preconditions would need to ...
Página 355
... preconditions whose criticality value is the highest possi- ble . These values reflect the expected difficulty of satisfying the precondition . To do this , do exactly what STRIPS did , but simply ignore preconditions of lower than peak ...
... preconditions whose criticality value is the highest possi- ble . These values reflect the expected difficulty of satisfying the precondition . To do this , do exactly what STRIPS did , but simply ignore preconditions of lower than peak ...
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