Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 61
Página 258
... relation corresponds to the relation element - of . Pee Wee Reese is an element of the set of fielders . Thus he is also an element of all of the supersets of fielders , including major league baseball players and people . The ...
... relation corresponds to the relation element - of . Pee Wee Reese is an element of the set of fielders . Thus he is also an element of all of the supersets of fielders , including major league baseball players and people . The ...
Página 265
... relation . It maps from elements of its domain ( the classes for which it makes sense ) to elements of its range ( its possible values ) . A relation is a set of ordered pairs . Thus it makes sense to say that one relation ( R1 ) is a ...
... relation . It maps from elements of its domain ( the classes for which it makes sense ) to elements of its range ( its possible values ) . A relation is a set of ordered pairs . Thus it makes sense to say that one relation ( R1 ) is a ...
Página 335
... relation is only affected by the UNSTACK operator if the blocks involved in the ON relation are the same ones involved in the UNSTACK operation . This can be said as [ ON ( m , n , s ) Ʌ- EQUAL ( m , x ) ] → ON ( m , n , DO ( UNSTACK ...
... relation is only affected by the UNSTACK operator if the blocks involved in the ON relation are the same ones involved in the UNSTACK operation . This can be said as [ ON ( m , n , s ) Ʌ- EQUAL ( m , x ) ] → ON ( m , n , DO ( UNSTACK ...
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