Labeling and Partial Arc Consistency for Soft Constraints

In this paper we generalize to soft constraints the techniques and approximations usually used for local consistency in classical constraint satisfaction and programming. The theoretical results show that this is indeed possible without loosing the fundamental properties of such techniques, and the experimental results (on partial arc-consistency) show that this work can help develop more eecient implementations for logic-based languages working with soft constraints.

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

[2]  Yan Georget,et al.  Encoding global constraints in semiring-based constraint solving , 1998, Proceedings Tenth IEEE International Conference on Tools with Artificial Intelligence (Cat. No.98CH36294).

[3]  Philippe Codognet,et al.  Compiling Constraints in clp(FD) , 1996, J. Log. Program..

[4]  Francesca Rossi,et al.  Semiring-based Constraint Logic Programming , 1997, IJCAI.

[5]  Francesca Rossi,et al.  Constraint Solving over Semirings , 1995, IJCAI.

[6]  Nicolas Beldiceanu,et al.  Overview of the CHIP Compiler System , 1993, WCLP.

[7]  Christian Bessiere,et al.  Arc-Consistency and Arc-Consistency Again , 1993, Artif. Intell..

[8]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.

[9]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[10]  D. Dubois,et al.  The calculus of fuzzy restrictions as a basis for flexible constraint satisfaction , 1993, [Proceedings 1993] Second IEEE International Conference on Fuzzy Systems.

[11]  Pascal Van Hentenryck,et al.  A Generic Arc-Consistency Algorithm and its Specializations , 1992, Artif. Intell..

[12]  Jean-francois Puget,et al.  A C++ implementation of CLP , 1997 .

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