The SeqBin Constraint Revisited

07/07/2012
by   George Katsirelos, et al.
0

We revisit the SeqBin constraint. This meta-constraint subsumes a number of important global constraints like Change, Smooth and IncreasingNValue. We show that the previously proposed filtering algorithm for SeqBin has two drawbacks even under strong restrictions: it does not detect bounds disentailment and it is not idempotent. We identify the cause for these problems, and propose a new propagator that overcomes both issues. Our algorithm is based on a connection to the problem of finding a path of a given cost in a restricted n-partite graph. Our propagator enforces domain consistency in O(nd^2) and, for special cases of SeqBin that include Change, Smooth and IncreasingNValue, in O(nd) time.

READ FULL TEXT
research
03/19/2011

The AllDifferent Constraint with Precedences

We propose AllDiffPrecedence, a new global constraint that combines toge...
research
09/24/2009

Flow-Based Propagators for the SEQUENCE and Related Global Constraints

We propose new filtering algorithms for the SEQUENCE constraint and some...
research
10/21/2011

A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints: Revised Edition that Incorporates One Correction

This paper introduces the SEQ BIN meta-constraint with a polytime algori...
research
07/10/2013

Tractable Combinations of Global Constraints

We study the complexity of constraint satisfaction problems involving gl...
research
05/03/2021

Bounds of MIN_NCC and MAX_NCC and filtering scheme for graph domain variables

Graph domain variables and constraints are an extension of constraint pr...
research
06/15/2017

Conjunctions of Among Constraints

Many existing global constraints can be encoded as a conjunction of amon...
research
11/28/2016

The BIN_COUNTS Constraint: Filtering and Applications

We introduce the BIN_COUNTS constraint, which deals with the problem of ...

Please sign up or login with your details

Forgot password? Click here to reset