The search result changed since you submitted your search request. Documents might be displayed in a different sort order.
  • search hit 5 of 47
Back to Result List

aspeed

  • Although Boolean Constraint Technology has made tremendous progress over the last decade, the efficacy of state-of-the-art solvers is known to vary considerably across different types of problem instances, and is known to depend strongly on algorithm parameters. This problem was addressed by means of a simple, yet effective approach using handmade, uniform, and unordered schedules of multiple solvers in ppfolio, which showed very impressive performance in the 2011 Satisfiability Testing (SAT) Competition. Inspired by this, we take advantage of the modeling and solving capacities of Answer Set Programming (ASP) to automatically determine more refined, that is, nonuniform and ordered solver schedules from the 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, evenAlthough Boolean Constraint Technology has made tremendous progress over the last decade, the efficacy of state-of-the-art solvers is known to vary considerably across different types of problem instances, and is known to depend strongly on algorithm parameters. This problem was addressed by means of a simple, yet effective approach using handmade, uniform, and unordered schedules of multiple solvers in ppfolio, which showed very impressive performance in the 2011 Satisfiability Testing (SAT) Competition. Inspired by this, we take advantage of the modeling and solving capacities of Answer Set Programming (ASP) to automatically determine more refined, that is, nonuniform and ordered solver schedules from the 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, the fact that our approach can be customized easily enabled us to swiftly adapt it to generate parallel schedules for multi-processor machines.show moreshow less

Download full text files

  • SHA-1: 87d3ae8710307c6fc36889d99b55616cfbdcfc49

Export metadata

Additional Services

Search Google Scholar Statistics
Metadaten
Author details:Holger HoosORCiD, Roland KaminskiORCiD, Marius LindauerORCiDGND, Torsten H. SchaubORCiDGND
URN:urn:nbn:de:kobv:517-opus4-414743
DOI:https://doi.org/10.25932/publishup-41474
ISSN:1866-8372
Title of parent work (English):Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe
Subtitle (English):solver scheduling via answer set programming
Publication series (Volume number):Zweitveröffentlichungen der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe (588)
Publication type:Postprint
Language:English
Date of first publication:2019/02/11
Publication year:2015
Publishing institution:Universität Potsdam
Release date:2019/02/11
Tag:algorithm schedules; answer set programming; portfolio-based solving
Issue:588
Number of pages:26
Source:Theory and Practice of Logic Programming 15 (2015) 1, pp. 117–142 DOI 10.1017/S1471068414000015
Organizational units:Mathematisch-Naturwissenschaftliche Fakultät
DDC classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Peer review:Referiert
Publishing method:Open Access
Grantor:Cambridge University Press (CUP)
License (German):License LogoKeine öffentliche Lizenz: Unter Urheberrechtsschutz
External remark:Bibliographieeintrag der Originalveröffentlichung/Quelle
Accept ✔
This website uses technically necessary session cookies. By continuing to use the website, you agree to this. You can find our privacy policy here.