Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 82
Página 178
... contains tile n Square 2 empty and Square 1 contains tile n Square 1 empty and Square 4 contains tile n Square 4 empty and Square 1 contains tile n Square 2 empty and Square 1 contains tile n Square 1 empty and Square 2 contains tile n ...
... contains tile n Square 2 empty and Square 1 contains tile n Square 1 empty and Square 4 contains tile n Square 4 empty and Square 1 contains tile n Square 2 empty and Square 1 contains tile n Square 1 empty and Square 2 contains tile n ...
Página 279
... contains the rules ; the second contains examples of their use ; and the third contains an English version of each example . The rules shown in the figure can be interpreted as follows : • Rule 1 describes the relationship between an ...
... contains the rules ; the second contains examples of their use ; and the third contains an English version of each example . The rules shown in the figure can be interpreted as follows : • Rule 1 describes the relationship between an ...
Página 358
... CONTAINS ( Iv , v ) ^ CONTAINS ( x , ov ) D : CONTAINS ( x , ov ) A : CONTAINS ( x , v ) Assume that there is at least one additional register , C , available . ( a ) What would STRIPS do with this problem ? ( b ) What would TWEAK do ...
... CONTAINS ( Iv , v ) ^ CONTAINS ( x , ov ) D : CONTAINS ( x , ov ) A : CONTAINS ( x , v ) Assume that there is at least one additional register , C , available . ( a ) What would STRIPS do with this problem ? ( b ) What would TWEAK do ...
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