Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 69
Página 65
... combined with other techniques to restrict the space in which to search even further , the technique can be very effective . For example , one early example of a successful AI program is DENDRAL [ Lindsay et al . , 1980 ] , which infers ...
... combined with other techniques to restrict the space in which to search even further , the technique can be very effective . For example , one early example of a successful AI program is DENDRAL [ Lindsay et al . , 1980 ] , which infers ...
Página 235
... combined to reflect the operation of multiple pieces of evidence and multiple rules applied to a problem . Fig- ure 8.1 illustrates three combination scenarios that we need to consider . In Figure 8.1 ( a ) , several rules all provide ...
... combined to reflect the operation of multiple pieces of evidence and multiple rules applied to a problem . Fig- ure 8.1 illustrates three combination scenarios that we need to consider . In Figure 8.1 ( a ) , several rules all provide ...
Página 410
... combined to form a larger semantic unit . The necessary rules for combining semantic structures are associated with the corresponding rules for combining syntactic structures . We use the word " compositional " to describe this approach ...
... combined to form a larger semantic unit . The necessary rules for combining semantic structures are associated with the corresponding rules for combining syntactic structures . We use the word " compositional " to describe this approach ...
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