License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICLP.2012.176
URN: urn:nbn:de:0030-drops-36208
URL: http://drops.dagstuhl.de/opus/volltexte/2012/3620/
Go to the corresponding Portal


Hoos, Holger ; Kaminski, Roland ; Schaub, Torsten ; Schneider, Marius

aspeed: ASP-based Solver Scheduling

pdf-format:
Document 1.pdf (463 KB)


Abstract

Although Boolean Constraint Technology has made tremendous progress over the last decade, it suffers from a great sensitivity to search configuration. This problem was impressively counterbalanced at the 2011 SAT Competition by the rather simple approach of ppfolio relying on a handmade, uniform and unordered solver schedule. Inspired by this, we take advantage of the modeling and solving capacities of ASP to automatically determine more refined, that is, non-uniform and ordered solver schedules from existing benchmarking data. We begin by formulating the determination of such schedules as multi-criteria optimization problems and provide corresponding ASP encodings. The resulting encodings are easily customizable for different settings and the computation of optimum schedules can mostly be done in the blink of an eye, even when dealing with large runtime data sets stemming from many solvers on hundreds to thousands of instances. Also, its high customizability made it easy to generate even parallel schedules for multi-core machines.

BibTeX - Entry

@InProceedings{hoos_et_al:LIPIcs:2012:3620,
  author =	{Holger Hoos and Roland Kaminski and Torsten Schaub and Marius Schneider},
  title =	{{aspeed: ASP-based Solver Scheduling}},
  booktitle =	{Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)},
  pages =	{176--187},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-43-9},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{17},
  editor =	{Agostino Dovier and V{\'i}tor Santos Costa},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2012/3620},
  URN =		{urn:nbn:de:0030-drops-36208},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.ICLP.2012.176},
  annote =	{Keywords: Algorithm Schedule, Portfolio-based Solving, Answer Set Programming}
}

Keywords: Algorithm Schedule, Portfolio-based Solving, Answer Set Programming
Seminar: Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)
Issue Date: 2012
Date of publication: 27.07.2012


DROPS-Home | Fulltext Search | Imprint Published by LZI