Challenging explanations for global constraints

This article presents the challenge of implementing explanations within global constraints. After defining explanations, it introduces what explanations for global constraints could be through the example of the all different constraint, then it presents the issues of their implementation and the interest of precise explanations. At last, it illustrates these principles with the stretch and flow constraints.

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

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

[3]  J. Carlier,et al.  Adjustment of heads and tails for the job-shop problem , 1994 .

[4]  Thierry Benoist,et al.  Constraint Programming Contribution to Benders Decomposition: A Case Study , 2002, CP.

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

[6]  Pascal Van Hentenryck,et al.  To Be or Not to Be ... a Global Constraint , 2003, CP.

[7]  L. Smith,et al.  To be or Not to Be , 1957, Journal of psychiatric nursing and mental health services.

[8]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[9]  Gilles Pesant,et al.  A Filtering Algorithm for the Stretch Constraint , 2001, CP.

[10]  Jean-Charles Régin,et al.  Generalized Arc Consistency for Global Cardinality Constraint , 1996, AAAI/IAAI, Vol. 1.

[11]  Guillaume Rochart,et al.  Explanations for global constraints : instrumenting the stretch constraint , 2003 .

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

[13]  Magnus Ågren.  Tracing and Explaining the Execution of CLP(FD) Programs in SICStus Prolog , 2002 .

[14]  Narendra Jussien.  E-constraints: Explanation-based constraint programming , 2001 .

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

[16]  Nicolas Beldiceanu,et al.  Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type , 2000, CP.

[17]  Pascal Van Hentenryck.  Improved CLP Scheduling with Task Intervals , 1994 .

[18]  Eugene C. Freuder,et al.  Contradicting Conventional Wisdom in Constraint Satisfaction , 1994, ECAI.

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