2 Search Results for "Schneider, Marius"


Document
Surviving Solver Sensitivity: An ASP Practitioner’s Guide

Authors: Bryan Silverthorn, Yuliya Lierler, and Marius Schneider

Published in: LIPIcs, Volume 17, Technical Communications of the 28th International Conference on Logic Programming (ICLP'12) (2012)


Abstract
Answer set programming (ASP) is a declarative programming formalism that allows a practitioner to specify a problem without describing an algorithm for solving it. In ASP, the tools for processing problem specifications are called answer set solvers. Because specified problems are often NP complete, these systems often require significant computational effort to succeed. Furthermore, they offer different heuristics, expose numerous parameters, and their running time is sensitive to the configuration used. Portfolio solvers and automatic algorithm configuration systems are recent attempts to automate the problem of manual parameter tuning, and to mitigate the burden of identifying the right solver configuration. The approaches taken in portfolio solvers and automatic algorithm configuration systems are orthogonal. This paper evaluates these approaches, separately and jointly, in the context of real-world ASP application development. It outlines strategies for their use in such settings, identifies their respective strengths and weaknesses, and advocates for a methodology that would make them an integral part of developing ASP applications.

Cite as

Bryan Silverthorn, Yuliya Lierler, and Marius Schneider. Surviving Solver Sensitivity: An ASP Practitioner’s Guide. In Technical Communications of the 28th International Conference on Logic Programming (ICLP'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 17, pp. 164-175, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)


Copy BibTex To Clipboard

@InProceedings{silverthorn_et_al:LIPIcs.ICLP.2012.164,
  author =	{Silverthorn, Bryan and Lierler, Yuliya and Schneider, Marius},
  title =	{{Surviving Solver Sensitivity: An ASP Practitioner’s Guide}},
  booktitle =	{Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)},
  pages =	{164--175},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-43-9},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{17},
  editor =	{Dovier, Agostino and Santos Costa, V{\'\i}tor},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2012.164},
  URN =		{urn:nbn:de:0030-drops-36192},
  doi =		{10.4230/LIPIcs.ICLP.2012.164},
  annote =	{Keywords: algorithm configuration, algorithm selection, portfolio solving, answer set programming, algorithm portfolios}
}
Document
aspeed: ASP-based Solver Scheduling

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

Published in: LIPIcs, Volume 17, Technical Communications of the 28th International Conference on Logic Programming (ICLP'12) (2012)


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.

Cite as

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)


Copy BibTex To Clipboard

@InProceedings{hoos_et_al:LIPIcs.ICLP.2012.176,
  author =	{Hoos, Holger and Kaminski, Roland and Schaub, Torsten and Schneider, Marius},
  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 =	{Dovier, Agostino and Santos Costa, V{\'\i}tor},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2012.176},
  URN =		{urn:nbn:de:0030-drops-36208},
  doi =		{10.4230/LIPIcs.ICLP.2012.176},
  annote =	{Keywords: Algorithm Schedule, Portfolio-based Solving, Answer Set Programming}
}
  • Refine by Author
  • 2 Schneider, Marius
  • 1 Hoos, Holger
  • 1 Kaminski, Roland
  • 1 Lierler, Yuliya
  • 1 Schaub, Torsten
  • Show More...

  • Refine by Classification

  • Refine by Keyword
  • 1 Algorithm Schedule
  • 1 Answer Set Programming
  • 1 Portfolio-based Solving
  • 1 algorithm configuration
  • 1 algorithm portfolios
  • Show More...

  • Refine by Type
  • 2 document

  • Refine by Publication Year
  • 2 2012

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail