Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 82
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 form1 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 form1 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 languages Spoken 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 languages Spoken slot . CYC further generalizes inheritance to apply to a chain of relations , allowing us ...
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