Lee and Siu made possible for the first time modeling and reasoning with set variables in weighted constraint satisfaction problems (WCSPs). In addition to an efficient set variable representation scheme, they also defined the notion of set bounds consistency, which is generalized from NC* and AC* for integer variables in WCSPs, and their associated enforcement algorithms. In this paper, we adapt ideas from FDAC and EDAC for integer variables to achieve stronger consistency notions for set variables. The generalization is non-trivial due to the common occurrence of ternary set constraints. Enforcement algorithms for the new consistencies are proposed. Empirical results confirm the feasibility and efficiency of our proposal.
[1]
Thomas Schiex,et al.
Solving weighted CSP by maintaining arc consistency
,
2004,
Artif. Intell..
[2]
Carmen Gervet,et al.
Interval propagation to reason about sets: Definition and implementation of a practical language
,
1997,
Constraints.
[3]
Simon de Givry,et al.
Existential arc consistency: Getting closer to full arc consistency in weighted CSPs
,
2005,
IJCAI.
[4]
Jimmy Ho-Man Lee,et al.
Weighted Constraint Satisfaction with Set Variables
,
2006,
AAAI.
[5]
Thomas Schiex,et al.
On the Complexity of Compact Coalitional Games
,
2009,
IJCAI.