The Ordered Distribute Constraint

Abstract : In this paper we introduce a new cardinality constraint: Ordered Distribute. Given a set of variables, this constraint limits for each value v the number of times v or any value greater than v is taken. It extends the global cardinality constraint, that constrains only the number of times a value v is taken by a set of variables and does not consider at the same time the occurrences of all the values greater than v. We design an algorithm for achieving generalized arc-consistency on Ordered Distribute, with a time complexity linear in the sum of the number of variables and the number of values in the union of their domains. In addition, we give some experiments showing the advantage of this new constraint for problems where values represent levels whose overrunning has to be under control. Finally, we present three extensions of our constraint that can be particularly useful in practice.
Document type :
Journal articles
International Journal on Artificial Intelligence Tools, World Scientific Publishing, 2011, 20 (4), pp.617-637. <http://www.worldscientific.com/doi/pdf/10.1142/S0218213011000371>. <10.1142/S0218213011000371>


https://hal.inria.fr/hal-00753742
Contributor : Thierry Petit <>
Submitted on : Monday, November 26, 2012 - 2:43:26 PM
Last modification on : Monday, November 26, 2012 - 4:27:56 PM

File

IJAITPetitRegin.pdf
fileSource_public_author

Identifiers

Collections

Citation

Thierry Petit, Jean-Charles Régin. The Ordered Distribute Constraint. International Journal on Artificial Intelligence Tools, World Scientific Publishing, 2011, 20 (4), pp.617-637. <http://www.worldscientific.com/doi/pdf/10.1142/S0218213011000371>. <10.1142/S0218213011000371>. <hal-00753742>

Export

Share

Metrics

Consultation de
la notice

85

Téléchargement du document

22