Deriving Explanations and Implications for Constraint Satisfaction Problems
We explore the problem of deriving explanations and implications for constraint satisfaction problems (CSPs). We show that consistency methods can be used to generate inferences that support both functions. Explanations take the form of trees that showthe basis for assignments and deletions in terms of previous selections. These ideas are illustrated by dynamic, interactive testbeds.
Unable to display preview. Download preview PDF.
- Dell. Dell Math Puzzles and Logic Problems. Dell Magazines, 2000.Google Scholar
- K. D. Forbus and J. deKleer. Building Problem Solvers. MIT, Cambridge, MA, 1993.Google Scholar
- E. C. Freuder, C. Likitvivatanavong, and R. J. Wallace. A case study in explanation and implication. In CP2000 Workshop on Analysis and Visualization of Constraint Programs and Solvers, 2000.Google Scholar