The PaLM system: explanation-based constraint programming

Explanation-based constraint programming is a new way of solving constraint problems: it allows to propagate constraints of the problem, learning from failure and from the solver (thanks to recording explanations) and nally allows to get rid of backtrack-based complete searches by allowing more free moves in the search space (while remaining complete). This paper presents the PaLM system, an implementation of an explanation-based constraint programming system in choco [16], a constraint programming layer on top of claire [3].

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

[2]  François Laburthe,et al.  CLAIRE: combining sets, search and rules to better express algorithms , 1999, Theory and Practice of Logic Programming.

[3]  François Laburthe,et al.  Improved CLP Scheduling with Task Intervals , 1994, ICLP.

[4]  Narendra Jussien,et al.  Combining AI/OR techniques for solving Open-Shop problems , 1999 .

[5]  Christelle Guéret,et al.  A new lower bound for the open‐shop problem , 1999, Ann. Oper. Res..

[6]  Narendra Jussien,et al.  Dynamic Domain Splitting for Numeric CSPs , 1998, ECAI.

[7]  Daniel P. Miranker,et al.  A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem , 1996, AAAI/IAAI, Vol. 1.

[8]  Romuald Debruyne,et al.  Arc-consistency in dynamic CSPs is no more prohibitive , 1996, Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence.

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

[10]  Eugene C. Freuder,et al.  Neighborhood Inverse Consistency Preprocessing , 1996, AAAI/IAAI, Vol. 1.

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

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

[13]  Pascal Van Hentenryck,et al.  Numerica: A Modeling Language for Global Optimization , 1997, IJCAI.

[14]  Narendra Jussien,et al.  Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems , 1998, Eur. J. Oper. Res..

[15]  Patrice Boizumault,et al.  Best-First Search for Property Maintenance in Reactive Constraint Systems , 1997, ILPS.