Among, common and disjoint constraints

Authors:
Christian Bessiere;Emmanuel Hebrard;Brahim Hnich;Zeynep Kiziltan;Toby Walsh
Affiliations:
LIRMM CNRS, University of Montpellier, France;NICTA and UNSW, Sydney, Australia;Izmir University of Economics, Turkey;University of Bologna, Italy;NICTA and UNSW, Sydney, Australia
Venue:
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
Year:
2005

Citing 6
Cited 4

A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Increasing Constraint Propagation by Redundant Modeling: \an Experience Report

Constraints
Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
The complexity of global constraints

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
The range and roots constraints: specifying counting and occurrence problems

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Generalized arc consistency for global cardinality constraint

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Range and Roots: Two common patterns for specifying and propagating counting and occurrence constraints

Artificial Intelligence
The parameterized complexity of global constraints

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Learning implied global constraints

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The conjunction of interval among constraints

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Quantified Score

Hi-index	0.00

Visualization

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.