Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 52
Página 301
... components of the circuit impose on the states of other components by virtue of being connected together . If the state of one of these components changes , we can propagate the effect of the change throughout the circuit by using the ...
... components of the circuit impose on the states of other components by virtue of being connected together . If the state of one of these components changes , we can propagate the effect of the change throughout the circuit by using the ...
Página 488
... Components in digital computers , on the other hand , must operate perfectly . Why ? Such components store bits of information that are available nowhere else in the computer : the failure of one component means a loss of information ...
... Components in digital computers , on the other hand , must operate perfectly . Why ? Such components store bits of information that are available nowhere else in the computer : the failure of one component means a loss of information ...
Página 532
... components . Because the components are connected , they influence one another . The constraint satisfaction technique ( Chapters 3 and 14 ) is one efficient way of propagating a change in one component to other nearby components ...
... components . Because the components are connected , they influence one another . The constraint satisfaction technique ( Chapters 3 and 14 ) is one efficient way of propagating a change in one component to other nearby components ...
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