A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints

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. SEQ_BIN can be used for encoding counting constraints such as CHANGE, SMOOTH, or INCREASING NVALUE. For all of them the time and space complexity is linear in the sum of domain sizes, which improves or equals the best known results of the literature.
Document type :
Conference papers
Complete list of metadatas

Contributor : Contraintes Lina <>
Submitted on : Tuesday, November 20, 2012 - 7:10:57 AM
Last modification on : Friday, June 22, 2018 - 9:29:33 AM


  • HAL Id : hal-00754017, version 1


Thierry Petit, Nicolas Beldiceanu, Xavier Lorca. A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints. 22th International Joint Conference on Artificial Intelligence (IJCAI'11), Aug 2011, Barcelona, Spain. pp.643-648. ⟨hal-00754017⟩



Record views