Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 88
Página 182
... allowed as the right sides of rules , then the rules will not be reversible . Some production languages allow only reversible rules ; others do not . When irreversible rules are used , then a commitment to the direction of the search ...
... allowed as the right sides of rules , then the rules will not be reversible . Some production languages allow only reversible rules ; others do not . When irreversible rules are used , then a commitment to the direction of the search ...
Página 202
... allows us to conclude -Pacifist ( Dick ) . Having done that , the second assertion cannot apply , since it is not ... allow inference rules of the form4 A : B C Such a rule should be read as , “ If A is provable and it is consistent ...
... allows us to conclude -Pacifist ( Dick ) . Having done that , the second assertion cannot apply , since it is not ... allow inference rules of the form4 A : B C Such a rule should be read as , “ If A is provable and it is consistent ...
Página 290
... allow inheritance to proceed along the friend relation — any frame with Mary on its friend slot inherits the value Spanish on its languagesSpoken slot . CYC further generalizes inheritance to apply to a chain of relations , allowing us ...
... allow inheritance to proceed along the friend relation — any frame with Mary on its friend slot inherits the value Spanish on its languagesSpoken slot . CYC further generalizes inheritance to apply to a chain of relations , allowing us ...
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