Global Constraints for Lexicographic Orderings
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Cardinal: A Finite Sets Constraint Solver
Constraints
Enhancing set constraint solvers with lexicographic bounds
Journal of Heuristics
Length-lex ordering for set CSPs
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Solving set constraint satisfaction problems using ROBDDs
Journal of Artificial Intelligence Research
Evaluation of length-lex set variables
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Exponential propagation for set variables
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Hi-index | 0.00 |
This paper considers feasibility checking and filtering of global constraints over set variables. It makes four main contributions. (1) It presents a feasibility checker for the global alldisjoint constraint. (2) It proposes primal filters for the combination of a global disjoint constraint and symmetry-breaking constraints. (3) It proposes dual filters for global intersection constraints. (4) It presents primal/dual filters for the combination of a global intersection constraint and symmetry-breaking constraints. All these contributions are independent of the underlying domain representation. Experimental results show that these proposals have complementary benefits, may improve efficiency significantly, and make it possible to solve larger instances of two standard benchmarks.