Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 19
Página 253
... Semantic Net for an n - Place Predicate isa ( Person , Mammal ) instance ( Pee - Wee - Reese , Person ) team ( Pee - Wee - Reese , Brooklyn - Dodgers ) uniform - color Pee - Wee - Reese , Blue ) But the knowledge expressed by predicates ...
... Semantic Net for an n - Place Predicate isa ( Person , Mammal ) instance ( Pee - Wee - Reese , Person ) team ( Pee - Wee - Reese , Brooklyn - Dodgers ) uniform - color Pee - Wee - Reese , Blue ) But the knowledge expressed by predicates ...
Página 255
... be represented by a single net with no partitioning . But now suppose that we want to represent the fact Every dog has bitten a mail carrier . or , in logic : SA Mail- Dogs Bite GS carrier Dogs Bite Mail- carrier 9.1 . SEMANTIC NETS 255.
... be represented by a single net with no partitioning . But now suppose that we want to represent the fact Every dog has bitten a mail carrier . or , in logic : SA Mail- Dogs Bite GS carrier Dogs Bite Mail- carrier 9.1 . SEMANTIC NETS 255.
Página 257
... semantic net are related to each other by an inclusion hierarchy . For example , in Figure 9.4 ( d ) , space $ 1 is included in space SA . Whenever a search process operates in a partitioned semantic net , it can explore nodes and arcs ...
... semantic net are related to each other by an inclusion hierarchy . For example , in Figure 9.4 ( d ) , space $ 1 is included in space SA . Whenever a search process operates in a partitioned semantic net , it can explore nodes and arcs ...
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