Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 81
Página 125
... approach taken in conceptual dependency theory , discussed in Chapter 10. Even for selecting simple structures , such as those representing the meanings of individual words , though , this approach may not be adequate , since many words ...
... approach taken in conceptual dependency theory , discussed in Chapter 10. Even for selecting simple structures , such as those representing the meanings of individual words , though , this approach may not be adequate , since many words ...
Página 242
... approach can be used . For example , in singly connected networks ( those in which there is only a single path between every pair of nodes ) , a simpler algorithm can be used than in the case of multiply connected ones . For details ...
... approach can be used . For example , in singly connected networks ( those in which there is only a single path between every pair of nodes ) , a simpler algorithm can be used than in the case of multiply connected ones . For details ...
Página 414
... approach to semantics , then we apply semantic interpretation rules to each syntactic constituent , eventually producing an interpretation for an entire sentence . But making a commitment about what to do implies no specific commitment ...
... approach to semantics , then we apply semantic interpretation rules to each syntactic constituent , eventually producing an interpretation for an entire sentence . But making a commitment about what to do implies no specific commitment ...
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