Skip to Main content Skip to Navigation
Conference papers

Among, Common and Disjoint Constraints

Abstract : Among, Common and Disjoint are global constraints useful in modelling problems involving resources. We study a number of variations of these constraints over integer and set variables. We show how computational complexity can be used to determine whether achieving the highest level of consistency is tractable. For tractable constraints, we present a polynomial propagation algorithm and compare it to logical decompositions with respect to the amount of constraint propagation. For intractable cases, we show in many cases that a propagation algorithm can be adapted from a propagation algorithm of a similar tractable one.
Document type :
Conference papers
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00378928
Contributor : Isabelle Gouat <>
Submitted on : Monday, April 27, 2009 - 12:29:45 PM
Last modification on : Wednesday, June 3, 2020 - 5:42:02 AM

Identifiers

  • HAL Id : lirmm-00378928, version 1

Collections

Citation

Christian Bessière, Emmanuel Hébrard, Brahim Hnich, Zeynep Kiziltan, Toby Walsh. Among, Common and Disjoint Constraints. Proceedings CSCLP: Revised Selected and Invited Papers, Uppsala, Sweden, pp.29-43. ⟨lirmm-00378928⟩

Share

Metrics

Record views

157