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

Authors:
Christian Bessiere;Emmanuel Hebrard;Brahim Hnich;Zeynep Kiziltan;Toby Walsh
Affiliations:
LIRMM, CNRS and U. Montpellier, Montpellier, France;4C and UCC, Cork, Ireland;Izmir University of Economics, Izmir, Turkey;Department of Computer Science, Univ. di Bologna, Italy;NICTA and UNSW, Sydney, Australia
Venue:
Artificial Intelligence
Year:
2009

Citing 16
Cited 1

A generic arc-consistency algorithm and its specializations

Artificial Intelligence
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
The Symmetric Alldiff Constraint

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Automatic Generation of Music Programs

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
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
Filtering Algorithms for the NValue Constraint

Constraints
Handbook of Constraint Programming (Foundations of Artificial Intelligence)

Handbook of Constraint Programming (Foundations of Artificial Intelligence)
The Complexity of Reasoning with Global Constraints

Constraints
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
Filtering algorithms for the NVALUE constraint

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Among, common and disjoint constraints

CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
Open constraints in a closed world

CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Introducing global constraints in CHIP

Mathematical and Computer Modelling: An International Journal

Propagator groups

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose Range and Roots which are two common patterns useful for specifying a wide range of counting and occurrence constraints. We design specialised propagation algorithms for these two patterns. Counting and occurrence constraints specified using these patterns thus directly inherit a propagation algorithm. To illustrate the capabilities of the Range and Roots constraints, we specify a number of global constraints taken from the literature. Preliminary experiments demonstrate that propagating counting and occurrence constraints using these two patterns leads to a small loss in performance when compared to specialised global constraints and is competitive with alternative decompositions using elementary constraints.