Files in this item
Automatic discovery and exploitation of promising subproblems for tabulation
Item metadata
dc.contributor.author | Akgun, Ozgur | |
dc.contributor.author | Gent, Ian Philip | |
dc.contributor.author | Jefferson, Christopher Anthony | |
dc.contributor.author | Miguel, Ian James | |
dc.contributor.author | Nightingale, Peter William | |
dc.contributor.author | Salamon, András Z. | |
dc.contributor.editor | Hooker, John | |
dc.date.accessioned | 2018-08-28T14:30:08Z | |
dc.date.available | 2018-08-28T14:30:08Z | |
dc.date.issued | 2018 | |
dc.identifier | 253604678 | |
dc.identifier | b170a1ed-fb03-483a-860a-1e1482829944 | |
dc.identifier | 85053156483 | |
dc.identifier | 000546520500001 | |
dc.identifier.citation | Akgun , O , Gent , I P , Jefferson , C A , Miguel , I J , Nightingale , P W & Salamon , A Z 2018 , Automatic discovery and exploitation of promising subproblems for tabulation . in J Hooker (ed.) , Principles and Practice of Constraint Programming : 24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings . Lecture Notes in Computer Science , vol. 11008 , Springer , pp. 3-12 , 24th International Conference on Principles and Practice of Constraint Programming (CP 2018) , Lille , France , 27/08/18 . https://doi.org/10.1007/978-3-319-98334-9_1 | en |
dc.identifier.citation | conference | en |
dc.identifier.isbn | 9783319983332 | |
dc.identifier.isbn | 9783319983349 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.other | ORCID: /0000-0002-5052-8634/work/47928954 | |
dc.identifier.other | ORCID: /0000-0001-9519-938X/work/47928989 | |
dc.identifier.other | ORCID: /0000-0002-1415-9712/work/47929008 | |
dc.identifier.other | ORCID: /0000-0003-2979-5989/work/60887576 | |
dc.identifier.other | ORCID: /0000-0002-6930-2686/work/68281469 | |
dc.identifier.uri | https://hdl.handle.net/10023/15892 | |
dc.description | Funding: EP/P015638/1 and EP/P026842/1. Dr Jefferson holds a Royal Society University Research Fellowship. | en |
dc.description.abstract | The performance of a constraint model can often be improved by converting a subproblem into a single table constraint. In this paper we study heuristics for identifying promising subproblems. We propose a small set of heuristics to identify common cases such as expressions that will propagate weakly. The process of discovering promising subproblems and tabulating them is entirely automated in the tool Savile Row. A cache is implemented to avoid tabulating equivalent subproblems many times. We give a simple algorithm to generate table constraints directly from a constraint expression in Savile Row. We demonstrate good performance on the benchmark problems used in earlier work on tabulation, and also for several new problem classes. | |
dc.format.extent | 298661 | |
dc.language.iso | eng | |
dc.publisher | Springer | |
dc.relation.ispartof | Principles and Practice of Constraint Programming | en |
dc.relation.ispartofseries | Lecture Notes in Computer Science | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject | DAS | en |
dc.subject.lcc | QA75 | en |
dc.title | Automatic discovery and exploitation of promising subproblems for tabulation | en |
dc.type | Conference item | en |
dc.contributor.sponsor | EPSRC | en |
dc.contributor.sponsor | The Royal Society | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.doi | 10.1007/978-3-319-98334-9_1 | |
dc.identifier.grantnumber | EP/P026842/1 | en |
dc.identifier.grantnumber | UF1204070 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.