Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 74
Página 89
... constraints , which says that each number may correspond to only one letter and that the sums of the digits must be as they are given in the problem , is first ... constraints to be inferred from the ones 3.5 . CONSTRAINT SATISFACTION 89.
... constraints , which says that each number may correspond to only one letter and that the sums of the digits must be as they are given in the problem , is first ... constraints to be inferred from the ones 3.5 . CONSTRAINT SATISFACTION 89.
Página 90
... Constraint propagation terminates for one of two reasons . First , a contradiction may be detected . If this happens , then there is no solution consistent with all the known constraints . If the contradiction involves only those ...
... Constraint propagation terminates for one of two reasons . First , a contradiction may be detected . If this happens , then there is no solution consistent with all the known constraints . If the contradiction involves only those ...
Página 301
... Constraints Much of what we know about the world can be represented as sets of constraints . We talked in Section 3.5 about a very simple problem , cryptarithmetic , that can be described this way . But constraint - based ...
... Constraints Much of what we know about the world can be represented as sets of constraints . We talked in Section 3.5 about a very simple problem , cryptarithmetic , that can be described this way . But constraint - based ...
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