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

Thierry Petit 1 Nicolas Beldiceanu 1, * Xavier Lorca 1
* Corresponding author
1 TASC - Theory, Algorithms and Systems for Constraints
LINA - Laboratoire d'Informatique de Nantes Atlantique, Département informatique - EMN, Inria Rennes – Bretagne Atlantique
Abstract : This paper introduces the SEQ BIN meta-constraint with a polytime algorithm achieving generalized arc-consistency according to some properties. SEQ BIN can be used for encoding counting constraints such as CHANGE, SMOOTH or INCREASING NVALUE. For some of these constraints and some of their variants GAC can be enforced with a time and space complexity linear in the sum of domain sizes, which improves or equals the best known results of the literature.
Document type :
Reports
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00754032
Contributor : Contraintes Lina <>
Submitted on : Tuesday, November 20, 2012 - 7:34:48 AM
Last modification on : Friday, June 22, 2018 - 9:30:14 AM

Identifiers

  • HAL Id : hal-00754032, version 1

Citation

Thierry Petit, Nicolas Beldiceanu, Xavier Lorca. A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints:Revised Edition that Incorporates One Correction. 2011. ⟨hal-00754032⟩

Share

Metrics

Record views

328