VISEXP: Visualizing Constraint Solver Dynamics Using Explanations

In this paper, we introduce VISEXP: a new visualization tool designed to explore relations between constraints and variables in constraint problems. This tool uses the explanation network built throughout computation. We show that VISEXP is able to provide much more information about how search is performed than classical representations. Moreover, we illustrate the animation feature of VISEXP that provides invaluable tools for visualization and therefore analysis of the dynamics of constraint solvers.

[1]  Denis Lalanne,et al.  Interactive problem solving via algorithm visualization , 2000, IEEE Symposium on Information Visualization 2000. INFOVIS 2000. Proceedings.

[2]  Ulrich Junker.  Conflict Detection for Arbitrary Constraint Propagation Algorithms , 2001 .

[3]  Christian Schulte.  Oz Explorer: A Visual Constraint Programming Tool , 1996, PLILP.

[4]  Ben Shneiderman,et al.  Readings in information visualization - using vision to think , 1999 .

[5]  Satoru Kawai,et al.  An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..

[6]  Matthew L. Ginsberg,et al.  Dynamic Backtracking , 1993, J. Artif. Intell. Res..

[7]  Thomas C. Henderson,et al.  Arc and Path Consistency Revisited , 1986, Artif. Intell..

[8]  Patrice Boizumault,et al.  Maintaining Arc-Consistency within Dynamic Backtracking , 2000, CP.

[9]  Christian Bessiere,et al.  Arc-Consistency in Dynamic Constraint Satisfaction Problems , 1991, AAAI.

[10]  Pascal Van Hentenryck,et al.  The CHIP System: Constraint Handling In Prolog , 1988, CADE.

[11]  Jon Doyle,et al.  A Truth Maintenance System , 1979, Artif. Intell..

[12]  François Fages,et al.  CLPGUI: A Generic Graphical User Interface for Constraint Logic Programming , 2004, Constraints.

[13]  Thomas Schiex,et al.  Nogood Recording for static and dynamic constraint satisfaction problems , 1993, Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93).

[14]  Barry O'Sullivan,et al.  Useful Explanations , 2003, CP.

[15]  Narendra Jussien,et al.  The versatility of using explanations within constraint programming , 2003 .

[16]  Jean-Charles Régin,et al.  A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.

[17]  Narendra Jussien,et al.  Local search with constraint propagation and conflict-based heuristics , 2000, Artif. Intell..

[18]  Patrice Boizumault,et al.  k-relevant Explanations for Constraint Programming , 2003, FLAIRS.

[19]  Pierre Marquis,et al.  Consistency restoration and explanations in dynamic CSPs Application to configuration , 2002, Artif. Intell..

[20]  Narendra Jussien,et al.  The PaLM system: explanation-based constraint programming , 2000 .

[21]  Jean-Daniel Fekete,et al.  Excentric labeling: dynamic neighborhood labeling for data visualization , 1999, CHI '99.

[22]  Gérard Ferrand,et al.  Correctness of Constraint Retraction Algorithms , 2003, FLAIRS.

[23]  Pavel Berkhin,et al.  A Survey of Clustering Data Mining Techniques , 2006, Grouping Multidimensional Data.

[24]  M. Sheelagh T. Carpendale,et al.  A framework for unifying presentation space , 2001, UIST '01.

[25]  Eugene C. Freuder,et al.  Deriving Explanations and Implications for Constraint Satisfaction Problems , 2001, CP.