Checking and filtering global set constraints

  • Authors:
  • Justin Yip;Pascal Van Hentenryck

  • Affiliations:
  • Brown University, Providence, RI;Brown University, Providence, RI

  • Venue:
  • CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.