Among, Common and Disjoint Constraints - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2005

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.

Domains

Other [cs.OH]
No file

Dates and versions

lirmm-00378928 , version 1 (27-04-2009)

Identifiers

  • HAL Id : lirmm-00378928 , version 1

Cite

Christian Bessiere, 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⟩
106 View
0 Download

Share

Gmail Facebook X LinkedIn More