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
5 | 24 |
Heuristic Search Techniques | 63 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 28 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 fact frame 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 operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG properties 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