Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 64
Página 257
... frame systems offer . 9.2 Frames A frame is a collection of attributes ( usually called slots ) and associated values ( and possibly constraints on values ) that describe some entity in the world . Sometimes a frame describes an entity ...
... frame systems offer . 9.2 Frames A frame is a collection of attributes ( usually called slots ) and associated values ( and possibly constraints on values ) that describe some entity in the world . Sometimes a frame describes an entity ...
Página 258
... frame systems . Although not all frame systems are defined this way , we do so here . In this view , each frame repre- sents either a class ( a set ) or an instance ( an element of a class ) . To see how this works , consider the frame ...
... frame systems . Although not all frame systems are defined this way , we do so here . In this view , each frame repre- sents either a class ( a set ) or an instance ( an element of a class ) . To see how this works , consider the frame ...
Página 268
... frame system create the frames that represent slots as they are needed . Now let's look at examples of how these ... frame to which the slot is attached . We use the dot notation to specify the value of a slot of a frame . Specifically ...
... frame system create the frames that represent slots as they are needed . Now let's look at examples of how these ... frame to which the slot is attached . We use the dot notation to specify the value of a slot of a frame . Specifically ...
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