Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 39
Página 251
... inheritance along isa and instance links . This is an important aspect of these structures . Monotonic inheritance can be performed substantially more efficiently with such struc- tures than with pure logic , and nonmonotonic inheritance ...
... inheritance along isa and instance links . This is an important aspect of these structures . Monotonic inheritance can be performed substantially more efficiently with such struc- tures than with pure logic , and nonmonotonic inheritance ...
Página 271
... Inheritance Revisited In Chapter 4 , we presented a simple algorithm for inheritance . But that algorithm assumed that the isa hierarchy was a tree . This is often not the case . To support flexible representations of knowledge about ...
... Inheritance Revisited In Chapter 4 , we presented a simple algorithm for inheritance . But that algorithm assumed that the isa hierarchy was a tree . This is often not the case . To support flexible representations of knowledge about ...
Página 300
... inheritance that are much faster than doing property inheritance via resolution - based theorem proving . Part of the inefficiency of general reasoning methods like resolution can be overcome by intelligent indexing schemes , but the ...
... inheritance that are much faster than doing property inheritance via resolution - based theorem proving . Part of the inefficiency of general reasoning methods like resolution can be overcome by intelligent indexing schemes , but 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