Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 60
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 534
... relations in Figure 19.3 to the single relation MEETS . Here is the definition of the relation IS - BEFORE : ¡ IS - BEFORE j = 3k : ( i MEETS k ) ^ ( k MEETS j ) In other words , if i IS - BEFORE j , then there must be some k in between ...
... relations in Figure 19.3 to the single relation MEETS . Here is the definition of the relation IS - BEFORE : ¡ IS - BEFORE j = 3k : ( i MEETS k ) ^ ( k MEETS j ) In other words , if i IS - BEFORE j , then there must be some k in between ...
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