aspeed: ASP-based Solver Scheduling

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

Thumbnail PDF


  • Filesize: 462 kB
  • 12 pages

Document Identifiers

Author Details

Holger Hoos
Roland Kaminski
Torsten Schaub
Marius Schneider

Cite AsGet BibTex

Holger Hoos, Roland Kaminski, Torsten Schaub, and Marius Schneider. aspeed: ASP-based Solver Scheduling. In Technical Communications of the 28th International Conference on Logic Programming (ICLP'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 17, pp. 176-187, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)


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.
  • Algorithm Schedule
  • Portfolio-based Solving
  • Answer Set Programming


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail