The Ordered Distribute Constraint - Archive ouverte HAL Access content directly
Journal Articles International Journal on Artificial Intelligence Tools Year : 2011

The Ordered Distribute Constraint

(1, 2) , (3)


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.
Fichier principal
Vignette du fichier
IJAITPetitRegin.pdf (545.14 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00753742 , version 1 (26-11-2012)



Thierry Petit, Jean-Charles Régin. The Ordered Distribute Constraint. International Journal on Artificial Intelligence Tools, 2011, 20 (4), pp.617-637. ⟨10.1142/S0218213011000371⟩. ⟨hal-00753742⟩
556 View
222 Download



Gmail Facebook Twitter LinkedIn More