Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas A revision of an established text for undergraduate and postgraduate Artificial Intelligence courses, this text incorporates the latest research and methods. |
Dentro del libro
Resultados 1-3 de 43
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
What Is Artificial Intelligence? | 3 |
5 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 25 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 example fact 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 ON(C operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG 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