Learn More
We introduce a new generic propagation mechanism for constraint programming. A first advantage of our pruning technique stems from the fact that it can be applied on various global constraints. In this work we describe a filtering scheme for such a family based on Dulmage-Mendelsohn Structure Theorem. Our method checks the feasibility in polynomial time and(More)
  • 1