A GAC Algorithm for a Class of Global Counting Constraints

Nicolas Beldiceanu 1 Xavier Lorca 1 Thierry Petit 2, 1
2 TASC - Theory, Algorithms and Systems for Constraints
Inria Rennes – Bretagne Atlantique , Département informatique - EMN, LINA - Laboratoire d'Informatique de Nantes Atlantique
Abstract : This paper presents the constraint class seq bin(N;X;C;B) where N is an integer variable, X is a sequence of integer variables and C and B are two binary constraints. A constraint of the seq bin class enforces the two following conditions: (1) N is equal to the number of times that the constraint C is satised on two consecutive variables in X, and (2) B holds on any pair of consecutive variables in X. Providing that B satises the particular property of neighborhood-substitutability, we come up with a ltering algorithm that achieves generalized arc-consistency (GAC) for seq bin(N;X;C;B). This algorithm can be directly used for the constraints Change, Smooth, Increasing Nvalue, Among and Increasing Among, in time linear in the sum of domain sizes. For all these constraints, this time complexity either improves the best known results, or equals those results.
Document type :
Other publications
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00517122
Contributor : Thierry Petit <>
Submitted on : Monday, September 13, 2010 - 3:39:30 PM
Last modification on : Friday, June 22, 2018 - 9:30:11 AM
Long-term archiving on : Tuesday, October 23, 2012 - 4:05:50 PM

File

nbtp100410.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00517122, version 1

Citation

Nicolas Beldiceanu, Xavier Lorca, Thierry Petit. A GAC Algorithm for a Class of Global Counting Constraints. 2010. ⟨hal-00517122⟩

Share

Metrics

Record views

461

Files downloads

142