Soft CLP (FD)

Over-constrained problems can be solved with the help of soft constraints. Weighted constraints are a typical representation of soft constraints used to minimize weights of unsatisfied constraints. A natural extension of the CLP(FD) approach is presented which allows handling of weighted soft constraints. To achieve this goal, the costs associated with unsatisfied constraints is accumulated for each problem variable and its value. For the approach proposed, implementation of the soft constraint solver on top of the existing CLP(FD) library of SICStus Prolog is described. A large scale timetabling implementation demonstrates practical application of the approach presented.

[1]  Didier Dubois,et al.  Possibility theory in constraint satisfaction problems: Handling priority, preference and uncertainty , 1996, Applied Intelligence.

[2]  Richard J. Wallace,et al.  Directed Arc Consistency Preprocessing , 1995, Constraint Processing, Selected Papers.

[3]  Javier Larrosa,et al.  Exploiting the Use of DAC in MAX-CSP , 1996, CP.

[4]  Francesca Rossi,et al.  Semiring-based constraint solving and optimization , 1997 .

[5]  Jin-Kao Hao,et al.  Tabu Search for Maximal Constraint Satisfaction Problems , 1997, CP.

[6]  Thomas Schiex,et al.  Valued Constraint Satisfaction Problems: Hard and Easy Problems , 1995, IJCAI.

[7]  Yan Georget,et al.  Compiling Semiring-Based Constraints with clp (FD, S) , 1998, CP.

[8]  Francesca Rossi,et al.  Soft Constraint Propagation and Solving in Constraint Handling Rules , 2004, Comput. Intell..

[9]  Thomas Schiex,et al.  Maintaining Reversible DAC for Max-CSP , 1999, Artif. Intell..

[10]  Hana Rudová,et al.  University Course Timetabling with Soft Constraints , 2002, PATAT.

[11]  Mats Carlsson,et al.  An Open-Ended Finite Domain Constraint Solver , 1997, PLILP.

[12]  Programming Languages: Implementations, Logics and Programs , 1995, Lecture Notes in Computer Science.

[13]  Francesca Rossi,et al.  Constraint Propagation for Soft Constraint Satisfaction Problems: Generalization and Termination Conditions , 2000 .

[14]  Richard J. Wallace,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[15]  Thomas Schiex,et al.  Russian Doll Search for Solving Constraint Optimization Problems , 1996, AAAI/IAAI, Vol. 1.

[16]  Niklaus Wirth,et al.  Algorithms + Data Structures = Programs , 1976 .

[17]  Hana Rudová,et al.  Limited Assignment Number Search Algorithm , 2002 .

[18]  Hachemi Bennaceur,et al.  A Weighted Arc Consistency Technique for MAX-CSP , 1998, ECAI.

[19]  Javier Larrosa,et al.  Lower Bounds for Non-binary Constraint Optimization Problems , 2001, CP.