Slide: a Useful Special Case of the Cardpath Constraint
| dc.contributor.author | Bessiere C. | |
| dc.contributor.author | Hebrard E. | |
| dc.contributor.author | Hnich B. | |
| dc.contributor.author | Kiziltan Z. | |
| dc.contributor.author | Walsh T. | |
| dc.date.accessioned | 2023-06-16T15:03:10Z | |
| dc.date.available | 2023-06-16T15:03:10Z | |
| dc.date.issued | 2008 | |
| dc.description | 18th European Conference on Artificial Intelligence, ECAI 2008 -- 21 July 2008 through 25 July 2008 -- 139245 | en_US |
| dc.description.abstract | We study the CARDPATH constraint. This ensures a given constraint holds a number of times down a sequence of variables. We show that SLIDE, a special case of CARDPATH where the slid constraint must hold always, can be used to encode a wide range of sliding sequence constraints including CARDPATH itself. We consider how to propagate SLIDE and provide a complete propagator for CARDPATH. Since propagation is NP-hard in general, we identify special cases where propagation takes polynomial time. Our experiments demonstrate that using SLIDE to encode global constraints can be as efficient and effective as specialised propagators. © 2008 The authors and IOS Press. All rights reserved. | en_US |
| dc.description.sponsorship | SOBAG-108K027; Türkiye Bilimsel ve Teknolojik Araştirma Kurumu, TÜBITAK | en_US |
| dc.description.sponsorship | 1 LIRMM (CNRS / U. Montpellier), France, email: bessiere@lirmm.fr. Sup-ported by the ANR project ANR-06-BLAN-0383-02. 2 4C, UCC, Ireland, email: ehebrard@4c.ucc.ie. 3 Izmir Uni. of Economics, Turkey, email: brahim.hnich@ieu.edu.tr. Sup-ported by the Scientific and Technological Research Council of Turkey (TUBITAK) under Grant No. SOBAG-108K027. 4 CS Department, Uni. of Bologna, Italy, email: zeynep@cs.unibo.it. 5 NICTA and UNSW, Sydney, Australia, email: toby.walsh@nicta.com.au. Funded by the Australian Government’s Department of Broadband, Com-munications and the Digital Economy, and the ARC. | en_US |
| dc.identifier.doi | 10.3233/978-1-58603-891-5-475 | |
| dc.identifier.isbn | 9.78E+11 | |
| dc.identifier.issn | 0922-6389 | |
| dc.identifier.scopus | 2-s2.0-85052003302 | |
| dc.identifier.uri | https://doi.org/10.3233/978-1-58603-891-5-475 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14365/3760 | |
| dc.language.iso | en | en_US |
| dc.publisher | IOS Press | en_US |
| dc.relation.ispartof | Frontiers in Artificial Intelligence and Applications | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.subject | Polynomial approximation | en_US |
| dc.subject | Global constraints | en_US |
| dc.subject | NP-hard | en_US |
| dc.subject | Polynomial-time | en_US |
| dc.subject | Encoding (symbols) | en_US |
| dc.title | Slide: a Useful Special Case of the Cardpath Constraint | en_US |
| dc.type | Conference Object | en_US |
| dspace.entity.type | Publication | |
| gdc.author.scopusid | 6701546627 | |
| gdc.author.scopusid | 6602458958 | |
| gdc.author.scopusid | 55962417500 | |
| gdc.author.scopusid | 55806690200 | |
| gdc.bip.impulseclass | C5 | |
| gdc.bip.influenceclass | C5 | |
| gdc.bip.popularityclass | C5 | |
| gdc.coar.access | metadata only access | |
| gdc.coar.type | text::conference output | |
| gdc.collaboration.industrial | false | |
| gdc.description.departmenttemp | Bessiere, C., LIRMM (CNRS / U. Montpellier), France; Hebrard, E., 4C, UCC, Ireland; Hnich, B., Izmir Uni. of Economics, Turkey; Kiziltan, Z., CS Department, Uni. of Bologna, Italy; Walsh, T., NICTA and UNSW, Sydney, Australia | en_US |
| gdc.description.endpage | 479 | en_US |
| gdc.description.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
| gdc.description.scopusquality | Q4 | |
| gdc.description.startpage | 475 | en_US |
| gdc.description.volume | 178 | en_US |
| gdc.description.wosquality | N/A | |
| gdc.identifier.openalex | W2963402450 | |
| gdc.index.type | Scopus | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.impulse | 0.0 | |
| gdc.oaire.influence | 2.4895952E-9 | |
| gdc.oaire.isgreen | true | |
| gdc.oaire.keywords | [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI] | |
| gdc.oaire.keywords | FOS: Computer and information sciences | |
| gdc.oaire.keywords | Computer Science - Computational Complexity | |
| gdc.oaire.keywords | Artificial Intelligence (cs.AI) | |
| gdc.oaire.keywords | I.2.4 | |
| gdc.oaire.keywords | Computer Science - Artificial Intelligence | |
| gdc.oaire.keywords | Computational Complexity (cs.CC) | |
| gdc.oaire.popularity | 3.7599898E-10 | |
| gdc.oaire.publicfunded | true | |
| gdc.oaire.sciencefields | 0211 other engineering and technologies | |
| gdc.oaire.sciencefields | 0202 electrical engineering, electronic engineering, information engineering | |
| gdc.oaire.sciencefields | 02 engineering and technology | |
| gdc.openalex.collaboration | International | |
| gdc.openalex.fwci | 11.9379 | |
| gdc.openalex.normalizedpercentile | 0.99 | |
| gdc.openalex.toppercent | TOP 10% | |
| gdc.opencitations.count | 0 | |
| gdc.plumx.mendeley | 5 | |
| gdc.plumx.scopuscites | 32 | |
| gdc.scopus.citedcount | 32 | |
| relation.isOrgUnitOfPublication | e9e77e3e-bc94-40a7-9b24-b807b2cd0319 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | e9e77e3e-bc94-40a7-9b24-b807b2cd0319 |
Files
Original bundle
1 - 1 of 1