Deriving Explanations and Implications for Constraint Satisfaction Problems

Authors:
Eugene C. Freuder;Chavalit Likitvivatanavong;Richard J. Wallace
Affiliations:
-;-;-
Venue:
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Year:
2001

Citing 1
Cited 2

Building problem solvers

Building problem solvers

Peeking in solver strategies using explanations visualization of dynamic graphs for constraint programming

SoftVis '05 Proceedings of the 2005 ACM symposium on Software visualization
Maintaining constraint-based applications

Proceedings of the 4th international conference on Knowledge capture

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.