Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 45
Página 215
... dependency network offers a purely syntactic , domain - independent way to represent belief and change it consistently . Figure 7.5 shows how these three facts would be represented in a dependency network , which can be created as a ...
... dependency network offers a purely syntactic , domain - independent way to represent belief and change it consistently . Figure 7.5 shows how these three facts would be represented in a dependency network , which can be created as a ...
Página 277
... Dependency Conceptual dependency ( often nicknamed CD ) is a theory of how to represent the kind of knowledge about events that is usually contained in natural language sentences . The goal is to represent the knowledge in a way that ...
... Dependency Conceptual dependency ( often nicknamed CD ) is a theory of how to represent the kind of knowledge about events that is usually contained in natural language sentences . The goal is to represent the knowledge in a way that ...
Página 279
... dependency structures . The dependencies among conceptualizations correspond to semantic relations among the underlying concepts . Figure 10.2 lists the most important ones allowed by CD . ' The first column contains the rules ; the ...
... dependency structures . The dependencies among conceptualizations correspond to semantic relations among the underlying concepts . Figure 10.2 lists the most important ones allowed by CD . ' The first column contains the rules ; the ...
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