Decomposition of the NVALUE constraint

Details Decomposition of the NVALUE constraint Decomposition of the NVALUE constraint

2009-09-17

arxiv.org/abs/0909.3273v1

Computer Science

Artificial Intelligence

To appear in Proceedings of the Eighth International Workshop on Constraint Modelling and Reformulation, held alongside the 15

Scientific paper

We study decompositions of NVALUE, a global constraint that can be used to model a wide range of problems where values need to be counted. Whilst decomposition typically hinders propagation, we identify one decomposition that maintains a global view as enforcing bound consistency on the decomposition achieves bound consistency on the original global NVALUE constraint. Such decompositions offer the prospect for advanced solving techniques like nogood learning and impact based branching heuristics. They may also help SAT and IP solvers take advantage of the propagation of global constraints.

Affiliated with

Also associated with

No associations

Rating

Decomposition of the NVALUE constraint does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Decomposition of the NVALUE constraint, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decomposition of the NVALUE constraint will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-391629