Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14365/1072
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bessiere, Christian | - |
dc.contributor.author | Hebrard, Emmanuel | - |
dc.contributor.author | Hnich, Brahim | - |
dc.contributor.author | Kiziltan, Zeynep | - |
dc.contributor.author | Walsh, Toby | - |
dc.date.accessioned | 2023-06-16T12:58:55Z | - |
dc.date.available | 2023-06-16T12:58:55Z | - |
dc.date.issued | 2009 | - |
dc.identifier.issn | 0004-3702 | - |
dc.identifier.issn | 1872-7921 | - |
dc.identifier.uri | https://doi.org/10.1016/j.artint.2009.03.001 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.14365/1072 | - |
dc.description.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. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Elsevier | en_US |
dc.relation.ispartof | Artıfıcıal Intellıgence | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Constraint programming | en_US |
dc.subject | Constraint satisfaction | en_US |
dc.subject | Global constraints | en_US |
dc.subject | Open global constraints | en_US |
dc.subject | Decompositions | en_US |
dc.subject | Algorithms | en_US |
dc.title | RANGE and ROOTS: Two common patterns for specifying and propagating counting and occurrence constraints | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1016/j.artint.2009.03.001 | - |
dc.identifier.scopus | 2-s2.0-67349112087 | en_US |
dc.department | İzmir Ekonomi Üniversitesi | en_US |
dc.authorid | Walsh, Toby/0000-0003-2998-8668 | - |
dc.authorid | Hnich, Brahim/0000-0001-8875-8390 | - |
dc.authorid | Hebrard, Emmanuel/0000-0003-3131-0709 | - |
dc.authorwosid | Hnich, Brahim/B-4435-2010 | - |
dc.authorwosid | Walsh, Toby/Q-9043-2016 | - |
dc.authorscopusid | 6701546627 | - |
dc.authorscopusid | 55897451800 | - |
dc.authorscopusid | 6602458958 | - |
dc.authorscopusid | 55962417500 | - |
dc.authorscopusid | 55806690200 | - |
dc.identifier.volume | 173 | en_US |
dc.identifier.issue | 11 | en_US |
dc.identifier.startpage | 1054 | en_US |
dc.identifier.endpage | 1078 | en_US |
dc.identifier.wos | WOS:000267675700002 | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.identifier.scopusquality | Q1 | - |
dc.identifier.wosquality | Q1 | - |
item.grantfulltext | open | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
item.openairetype | Article | - |
item.fulltext | With Fulltext | - |
item.languageiso639-1 | en | - |
Appears in Collections: | Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
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.