k-relevant Explanations for Constraint Programming

This paper presents diagnosis tools and interaction-based tools which could help the Constraint Programming user to interactively develop its applications. The implementation of these tools rely on explanations, and more precisely on k-relevant explanations. An example is given to illustrate k-relevant explanations and to provide concrete situations illustrating the functionalities of our interactive and diagnosis tools.

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

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

[3]  David A. McAllester,et al.  GSAT and Dynamic Backtracking , 1994, KR.

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

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

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

[7]  Thomas Schiex,et al.  Nogood Recording for Static and Dynamic Constraint Satisfaction Problems , 1994, Int. J. Artif. Intell. Tools.

[8]  Eugene C. Freuder,et al.  Inference-Based Constraint Satisfaction Supports Explanation , 1996, AAAI/IAAI, Vol. 1.

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

[10]  Philippe Codognet,et al.  The GNU Prolog system and its implementation , 2000, SAC '00.

[11]  Michael J. Maher,et al.  Constraint Hierarchies and Logic Programming , 1989, ICLP.

[12]  Michael J. Maher,et al.  Over-Constrained Systems , 1995, Lecture Notes in Computer Science.

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

[14]  Patrice Boizumault,et al.  Implementing Constraint Relaxation over Finite Domains using ATMS , 1996 .

[15]  Narendra Jussien,et al.  User-friendly explanations for constraint programming , 2001, WLPE.

[16]  Patrick Prosser,et al.  MAC-CBJ: maintaining arc consistency with conflict-directed backjumping , 1995 .

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

[18]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

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

[20]  Rina Dechter,et al.  Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition , 1990, Artif. Intell..

[21]  Christian Bliek,et al.  Generalizing Partial Order and Dynamic Backtracking , 1998, AAAI/IAAI.

[22]  Gerald J. Sussman,et al.  Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis , 1976, Artif. Intell..