Overview
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.
Software
Publications
- Hoos, H. H., Kaufmann, B., Schaub, T., & Schneider, M. (2013). Robust Benchmark Set Selection for Boolean Constraint Solvers. In LION (Vol. 7997, pp. 138–152). Springer.
- Gebser, M., Jost, H., Kaminski, R., Obermeier, P., Sabuncu, O., Schaub, T., & Schneider, M. (2013). Ricochet Robots: A Transverse ASP Benchmark. In LPNMR (Vol. 8148, pp. 348–360). Springer.
- Schneider, M., & Hoos, H. H. (2012). Quantifying Homogeneity of Instance Sets for Algorithm Configuration. In LION (Vol. 7219, pp. 190–204). Springer.
- Silverthorn, B., Lierler, Y., & Schneider, M. (2012). Surviving Solver Sensitivity: An ASP Practitioner’s Guide. In ICLP (Technical Communications) (Vol. 17, pp. 164–175). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
- Hoos, H., Leyton-Brown, K., Schaub, T., & Schneider, M. (2012). Algorithm Configuration for Portfolio-based Parallel SAT-Solving. In CoCoMile.
- Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T., Schneider, M. T., & Ziller, S. (2011). A Portfolio Solver for Answer Set Programming: Preliminary Report. In LPNMR (Vol. 6645, pp. 352–357). Springer.
Links
