A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

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

Résumé

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.
Fichier non déposé

Dates et versions

hal-00754017 , version 1 (20-11-2012)

Identifiants

  • HAL Id : hal-00754017 , version 1

Citer

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⟩
215 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More