Arc consistency for soft constraints

The notion of arc consistency plays a central role in constraint satisfaction [R. Dechter, Constraint Processing, Morgan Kaufmann, San Mateo, CA, 2003]. It is known since the introduction of valued and semi-ring constraint networks in 1995 that the notion of local consistency can be extended to constraint optimisation problems defined by soft constraint frameworks based on an idempotent cost combination operator. This excludes non-idempotent operators such as + which define problems which are very important in practical applications such as MAX-CSP, where the aim is to minimise the number of violated constraints.In this paper, we show that using a weak additional axiom satisfied by most existing soft constraints proposals, it is possible to define a notion of soft arc consistency that extends the classical notion of arc consistency and this even in the case of non-idempotent cost combination operators. A polynomial time algorithm for enforcing this soft arc consistency exists and its space and time complexities are identical to that of enforcing arc consistency in CSPs when the cost combination operator is strictly monotonic (for example MAX-CSP).A directional version of arc consistency, first introduced by M.C. Cooper [Reduction operations in fuzzy or valued constraint satisfaction, Fuzzy Sets and Systems 134 (3) (2003) 311-342] is potentially even stronger than the non-directional version, since it allows non-local propagation of penalties. We demonstrate the utility of directional arc consistency by showing that it not only solves soft constraint problems on trees, but that it also implies a form of local optimality, which we call arc irreducibility.

[1]  Javier Larrosa,et al.  Node and arc consistency in weighted CSP , 2002, AAAI/IAAI.

[2]  Thomas Schiex,et al.  On the Complexity of Compact Coalitional Games , 2009, IJCAI.

[3]  Roger Mohr,et al.  Good Old Discrete Relaxation , 1988, ECAI.

[4]  Thomas Schiex,et al.  Reversible DAC and Other Improvements for Solving Max-CSP , 1998, AAAI/IAAI.

[5]  Robert M. Haralick,et al.  Structural Descriptions and Inexact Matching , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Azriel Rosenfeld,et al.  Scene Labeling by Relaxation Operations , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[7]  Didier Dubois,et al.  A class of fuzzy measures based on triangular norms , 1982 .

[8]  Thomas Schiex,et al.  Semiring-Based CSPs and Valued CSPs: Frameworks, Properties, and Comparison , 1999, Constraints.

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

[10]  Francesc Esteva,et al.  Review of Triangular norms by E. P. Klement, R. Mesiar and E. Pap. Kluwer Academic Publishers , 2003 .

[11]  Rina Dechter,et al.  Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning , 1997, IJCAI.

[12]  Simon de Givry,et al.  Solving Max-SAT as Weighted CSP , 2003, CP.

[13]  Arie M. C. A. Koster,et al.  Frequency assignment : models and algorithms , 1999 .

[14]  Thomas Schiex,et al.  Selecting preferred solutions in Fuzzy Constraint Satisfaction Problems , 1993 .

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

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

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

[18]  Francesca Rossi,et al.  General Properties and Termination Conditions for Soft Constraint Propagation , 2004, Constraints.

[19]  Thomas Schiex,et al.  Possibilistic Constraint Satisfaction Problems or "How to Handle Soft Constraints?" , 1992, UAI.

[20]  Christian Bessiere,et al.  Arc Consistency for General Constraint Networks: Preliminary Results , 1997, IJCAI.

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

[22]  Simon de Givry,et al.  Bounding the Optimum of Constraint Optimization Problems , 1997, CP.

[23]  William S. Havens,et al.  An empirical study of probabilistic arc consistency as a variable ordering heuristic , 2000 .

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

[25]  K. Evans,et al.  Totally Ordered Commutative Monoids , 2001 .

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

[27]  Martin C. Cooper.  Reduction operations in fuzzy or valued constraint satisfaction , 2003, Fuzzy Sets Syst..