Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 66
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 396
... combined . The first must be of CAT DET . We do not care what its lexical entry is , but whatever it is will be bound to the label { 1 } . The second constituent must be of CAT N. Its lexical entry will be bound to the label { 2 } , and ...
... combined . The first must be of CAT DET . We do not care what its lexical entry is , but whatever it is will be bound to the label { 1 } . The second constituent must be of CAT N. Its lexical entry will be bound to the label { 2 } , and ...
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