Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 17
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 257
... semantic net are related to each other by an inclusion hierarchy . For example , in Figure 9.4 ( d ) , space S1 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 S1 is included in space SA . Whenever a search process operates in a partitioned semantic net , it can explore nodes and arcs ...
Página 275
... semantic net representations for the following : ( a ) Pompeian ( Marcus ) , Blacksmith ( Marcus ) ( b ) Mary gave the green flowered vase to her favorite cousin . 2. Suppose we want to use a semantic net to discover relationships that ...
... semantic net representations for the following : ( a ) Pompeian ( Marcus ) , Blacksmith ( Marcus ) ( b ) Mary gave the green flowered vase to her favorite cousin . 2. Suppose we want to use a semantic net to discover relationships that ...
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