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

Nicolas Beldiceanu 1, * Mats Carlsson 2 Thierry Petit 1 Jean-Charles Régin 3, 4
* Auteur correspondant
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 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.
Type de document :
Communication dans un congrès
Luc De Raedt and Christian Bessière and Didier Dubois and Patrick Doherty and Paolo Frasconi and Fredrik Heintz and Peter J. F. Lucas. 20th European Conference on Artificial Intelligence (ECAI'12), Aug 2012, Montpellier, France. IOS Press, 242, pp.145-150, 2012, Frontiers in Artificial Intelligence and Applications. <10.3233/978-1-61499-098-7-145>
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00754079
Contributeur : Contraintes Lina <>
Soumis le : mardi 20 novembre 2012 - 08:42:07
Dernière modification le : samedi 27 août 2016 - 01:04:49

Identifiants

Collections

Citation

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. Luc De Raedt and Christian Bessière and Didier Dubois and Patrick Doherty and Paolo Frasconi and Fredrik Heintz and Peter J. F. Lucas. 20th European Conference on Artificial Intelligence (ECAI'12), Aug 2012, Montpellier, France. IOS Press, 242, pp.145-150, 2012, Frontiers in Artificial Intelligence and Applications. <10.3233/978-1-61499-098-7-145>. <hal-00754079>

Partager

Métriques

Consultations de la notice

304