Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 84
Página 114
... discussed in this chapter . But making a clean distinction between declarative and procedural knowledge is difficult . Although at an intuitive level such a distinction makes some sense , at a formal level it disappears , as discussed ...
... discussed in this chapter . But making a clean distinction between declarative and procedural knowledge is difficult . Although at an intuitive level such a distinction makes some sense , at a formal level it disappears , as discussed ...
Página 226
... discussed in Chapter 6 could be augmented to support nonmonotonic reasoning . We then presented three kinds of TMS systems , all of which provide a basis for implementing nonmonotonic reasoning . We have considered two dimensions along ...
... discussed in Chapter 6 could be augmented to support nonmonotonic reasoning . We then presented three kinds of TMS systems , all of which provide a basis for implementing nonmonotonic reasoning . We have considered two dimensions along ...
Página 398
... discussed this issue briefly in Section 4.3.3 , and in Chapter 10 we looked at two proposals for a set of primitives , conceptual dependency and CYC . When natural language is being used as an interface language to another program ...
... discussed this issue briefly in Section 4.3.3 , and in Chapter 10 we looked at two proposals for a set of primitives , conceptual dependency and CYC . When natural language is being used as an interface language to another program ...
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