Range and Roots: Two Common Patterns for Specifying and Propagating Counting and Occurrence Constraints

Details Range and Roots: Two Common Patterns for Specifying and Propagating Counting and Occurrence Constraints Range and Roots: Two Common Patterns for Specifying and Propagating Counting and Occurrence Constraints

2009-03-02

arxiv.org/abs/0903.0211v1

Computer Science

Artificial Intelligence

41 pages, 7 figures

Scientific paper

We propose Range and Roots which are two common patterns useful for specifying a wide range of counting and occurrence constraints. We design specialised propagation algorithms for these two patterns. Counting and occurrence constraints specified using these patterns thus directly inherit a propagation algorithm. To illustrate the capabilities of the Range and Roots constraints, we specify a number of global constraints taken from the literature. Preliminary experiments demonstrate that propagating counting and occurrence constraints using these two patterns leads to a small loss in performance when compared to specialised global constraints and is competitive with alternative decompositions using elementary constraints.

Affiliated with

Also associated with

No associations

Rating

Range and Roots: Two Common Patterns for Specifying and Propagating Counting and Occurrence Constraints 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 Range and Roots: Two Common Patterns for Specifying and Propagating Counting and Occurrence Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Range and Roots: Two Common Patterns for Specifying and Propagating Counting and Occurrence Constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-77596