Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 55
Página 265
... slots . Before we can describe such a hierarchy in detail , we need to formalize our notion of a slot . A slot is a relation . It maps from elements of its domain ( the classes for which it makes sense ) to elements of its range ( its ...
... slots . Before we can describe such a hierarchy in detail , we need to formalize our notion of a slot . A slot is a relation . It maps from elements of its domain ( the classes for which it makes sense ) to elements of its range ( its ...
Página 268
... slot . But we often think of them as being properties of a slot associated with a particular class . For example , in Figure 9.5 , we listed two defaults for the batting - average slot , one associated with major league baseball players ...
... slot . But we often think of them as being properties of a slot associated with a particular class . For example , in Figure 9.5 , we listed two defaults for the batting - average slot , one associated with major league baseball players ...
Página 270
... slots are not treated explicitly by the frame - system interpreter , they will be useful precisely to the extent that the domain problem solver exploits them . 9.2.4 Slot - Values as Objects In the last section , we reified the notion of a ...
... slots are not treated explicitly by the frame - system interpreter , they will be useful precisely to the extent that the domain problem solver exploits them . 9.2.4 Slot - Values as Objects In the last section , we reified the notion of a ...
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