Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 83
Página 57
... important to make correct decisions the first time , although if the universe is predictable , planning can be used to make that less important . 2.5 Issues in the Design of Search Programs Every search process can be viewed as a ...
... important to make correct decisions the first time , although if the universe is predictable , planning can be used to make that less important . 2.5 Issues in the Design of Search Programs Every search process can be viewed as a ...
Página 125
... important problem with this method is that if the problem description contains any even slightly extraneous concepts ... important and which are not . But the relative importance of clues can change dramatically from one situation to ...
... important problem with this method is that if the problem description contains any even slightly extraneous concepts ... important and which are not . But the relative importance of clues can change dramatically from one situation to ...
Página 544
... important in certain contexts . For example , suppose it is cloudy . If your problem is to plan a picnic , you might want to retrieve other episodes involving cloudy days . But if your problem is to write a computer program , then the ...
... important in certain contexts . For example , suppose it is cloudy . If your problem is to plan a picnic , you might want to retrieve other episodes involving cloudy days . But if your problem is to write a computer program , then the ...
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