Although Boolean Constraint Technology has made tremendous progress over the
last decade, leading to industrial strength applications in SAT and related areas
such as ASP, PB, and even CP,
it suffers from a great sensitivity to search configuration.
One way to overcome this obstacle is the use of algorithm configuration.
clasp can be configured with an algorithm configurator, e.g., ParamILS, SMAC or GGA,
to improve its performance on a given (preferably homogeneous) instance set.
piclasp allows to configure clasp with the help of SMAC. For more details, please see README.txt in the current release.
Used in Literature
- H. Hoos, B. Kaufmann, T. Schaub and M. Schneider. Robust Benchmark Set Selection for Boolean Constraint Solvers (bib)
- M. Gebser, H. Jost, R. Kaminski, P. Obermeier, O. Sabuncu, T. Schaub, M. Schneider. Ricochet Robots: A transverse ASP benchmark (bib)
- Holger Hoos and Marius Schneider. Quantifying Homogeneity of Instance Sets for Algorithm Configuration (bib)
- Yuliya Lierler, Marius Schneider and Bryan Silverthorn. Surviving Solver Sensitivity: An ASP Practitioner's Guid (bib)
- Holger Hoos, Kevin Leyton-Brown, Torsten Schaub and Marius Schneider. Algorithm Configuration for Portfolio-based Parallel SAT-Solving (bib)
- Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub, Marius Schneider and Stefan Ziller. A Portfolio Solver for Answer Set Programming: Preliminary Report (bib)
- : ParamILS
- : SMAC (our recommendation)
- : GGA
- Algorithm Configuration library
- Programming by Optimization
(Please consider the recommendations under: Which design optimiser (algorithm configurator) should I use?)