An O(n log n) Bound Consistency Algorithm for the Conjunction of an alldifferent and an Inequality between a Sum of Variables and a Constant, and its Generalization - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

An O(n log n) Bound Consistency Algorithm for the Conjunction of an alldifferent and an Inequality between a Sum of Variables and a Constant, and its Generalization

Résumé

This paper gives an O(nlog n) bound-consistency filtering algorithm for the conjunction alldifferent(V0,V1,...,Vn−1)∧ f(V0)⌖f(V1)⌖...⌖f(Vn−1)≤ cst, (V0,V1,...,Vn−1,cst∊ +), where (,⌖) is a commutative group, f is a unary function, and both ⌖ and f are monotone increasing. This complexity is equal to the complexity of the bound-consistency algorithm of the alldifferent constraint.
Fichier non déposé

Dates et versions

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

Identifiants

Citer

Nicolas Beldiceanu, Mats Carlsson, Thierry Petit, Jean-Charles Régin. An O(n log n) Bound Consistency Algorithm for the Conjunction of an alldifferent and an Inequality between a Sum of Variables and a Constant, and its Generalization. 20th European Conference on Artificial Intelligence (ECAI'12), Aug 2012, Montpellier, France. pp.145-150, ⟨10.3233/978-1-61499-098-7-145⟩. ⟨hal-00754079⟩
268 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More