Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 54
Página 48
... decisions are recorded in case they need to be undone later . Irrecoverable problems , on the other hand , will need to be solved by a system that expends a great deal of effort making each decision since the decision must be final ...
... decisions are recorded in case they need to be undone later . Irrecoverable problems , on the other hand , will need to be solved by a system that expends a great deal of effort making each decision since the decision must be final ...
Página 133
... decision procedure , even an exponential one . There do exist procedures that will find a proof of a proposed theorem if indeed it is theorem . But these procedures are not guaranteed to halt if the proposed statement is not a theorem ...
... decision procedure , even an exponential one . There do exist procedures that will find a proof of a proposed theorem if indeed it is theorem . But these procedures are not guaranteed to halt if the proposed statement is not a theorem ...
Página 390
... decisions about the function of each component as it is encountered , procrastinate the decision until enough information is available to make the decision correctly . Using this approach , when the word " have " of our example is ...
... decisions about the function of each component as it is encountered , procrastinate the decision until enough information is available to make the decision correctly . Using this approach , when the word " have " of our example is ...
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