Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 78
Página 63
... discussed . These methods are all varieties of heuristic search . They can be described independently of any particular task or problem domain . But when applied to particular problems , their efficacy is highly dependent on the way ...
... discussed . These methods are all varieties of heuristic search . They can be described independently of any particular task or problem domain . But when applied to particular problems , their efficacy is highly dependent on the way ...
Página 137
... discussed the specific attributes instance and isa and described the important role they play in a particularly useful form of reasoning , property inheritance . But if we look back at the way we just represented our knowledge about ...
... discussed the specific attributes instance and isa and described the important role they play in a particularly useful form of reasoning , property inheritance . But if we look back at the way we just represented our knowledge about ...
Página 227
... discussed , we have assumed that belief status is a binary function . An assertion must eventually be either believed or not . Sometimes , this is too strong an assumption . In the next chapter , we present techniques for dealing with ...
... discussed , we have assumed that belief status is a binary function . An assertion must eventually be either believed or not . Sometimes , this is too strong an assumption . In the next chapter , we present techniques for dealing with ...
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