Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14365/1072
Title: | RANGE and ROOTS: Two common patterns for specifying and propagating counting and occurrence constraints | Authors: | Bessiere, Christian Hebrard, Emmanuel Hnich, Brahim Kiziltan, Zeynep Walsh, Toby |
Keywords: | Constraint programming Constraint satisfaction Global constraints Open global constraints Decompositions Algorithms |
Publisher: | Elsevier | 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. (C) 2009 Elsevier B.V. All rights reserved. | URI: | https://doi.org/10.1016/j.artint.2009.03.001 https://hdl.handle.net/20.500.14365/1072 |
ISSN: | 0004-3702 1872-7921 |
Appears in Collections: | Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Show full item record
CORE Recommender
SCOPUSTM
Citations
12
checked on Sep 25, 2024
WEB OF SCIENCETM
Citations
8
checked on Sep 25, 2024
Page view(s)
48
checked on Sep 30, 2024
Download(s)
8
checked on Sep 30, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.