Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 83
Página 41
... particular individuals . Some heuristics help to guide a search process without sacrificing any claims to completeness that the process might previously have had . Others ( in fact , many of the best ones ) may occasionally cause an ...
... particular individuals . Some heuristics help to guide a search process without sacrificing any claims to completeness that the process might previously have had . Others ( in fact , many of the best ones ) may occasionally cause an ...
Página 138
... particular inference rule is designed to work on one particular form of representation , it is necessary that all the knowledge to which that rule is intended to apply be in the form that the rule demands . Many errors in the reasoning ...
... particular inference rule is designed to work on one particular form of representation , it is necessary that all the knowledge to which that rule is intended to apply be in the form that the rule demands . Many errors in the reasoning ...
Página 227
... particular significance is diagnosis ( for example , of faults in a physical device ) [ Reiter , 1987b ; de Kleer and Williams , 1987 ] . Diagnosis is a natural application area for minimalist reasoning in particular , since one way to ...
... particular significance is diagnosis ( for example , of faults in a physical device ) [ Reiter , 1987b ; de Kleer and Williams , 1987 ] . Diagnosis is a natural application area for minimalist reasoning in particular , since one way to ...
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