The range and roots constraints: specifying counting and occurrence problems

Authors:
Christian Bessiere;Emmanuel Hebrard;Brahim Hnich;Zeynep Kiziltan;Toby Walsh
Affiliations:
LIRMM, CNRS, Montpelier, France;NICTA, Sydney, Australia and UNSW, Sydney, Australia;4C, UCC, Ireland;DEIS, Univ. di Bologna, Italy;NICTA, Sydney, Australia and UNSW, Sydney, Australia
Venue:
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Year:
2005

Citing 7
Cited 14

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
The complexity of global constraints

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Generalized arc consistency for global cardinality constraint

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

Combining Two Structured Domains for Modeling Various Graph Matching Problems

Recent Advances in Constraints
Generalizing Global Constraints Based on Network Flows

Recent Advances in Constraints
Range and Roots: Two common patterns for specifying and propagating counting and occurrence constraints

Artificial Intelligence
Circuit complexity and decompositions of global constraints

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Decompositions of all different, global cardinality and related constraints

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Reformulating global constraints: the slide and regular constraints

SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Decomposition of the NVALUE constraint

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
The ROOTS constraint

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Generating propagators for finite set constraints

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Among, common and disjoint constraints

CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
Undirected forest constraints

CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The range constraint: algorithms and implementation

CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
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
Exploiting constraints

ILP'11 Proceedings of the 21st international conference on Inductive Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a simple declarative language for specifying a wide range of counting and occurrence constraints. This specification language is executable since it immediately provides a polynomial propagation algorithm. To illustrate the capabilities of this language, we specify a dozen global constraints taken from the literature. We observe one of three outcomes: we achieve generalized arc-consistency; we do not achieve generalized arc-consistency, but achieving generalized arc-consistency is NP-hard; we do not achieve generalized arc-consistency, but specialized propagation algorithms can do so in polynomial time. Experiments demonstrate that this specification language is both efficient and effective in practice.