claspfolio2: Advances in Algorithm Selection for Answer Set Programming
From MaRDI portal
Publication:2931265
Abstract: To appear in Theory and Practice of Logic Programming (TPLP). Building on the award-winning, portfolio-based ASP solver claspfolio, we present claspfolio 2, a modular and open solver architecture that integrates several different portfolio-based algorithm selection approaches and techniques. The claspfolio 2 solver framework supports various feature generators, solver selection approaches, solver portfolios, as well as solver-schedule-based pre-solving techniques. The default configuration of claspfolio 2 relies on a light-weight version of the ASP solver clasp to generate static and dynamic instance features. The flexible open design of claspfolio 2 is a distinguishing factor even beyond ASP. As such, it provides a unique framework for comparing and combining existing portfolio-based algorithm selection approaches and techniques in a single, unified framework. Taking advantage of this, we conducted an extensive experimental study to assess the impact of different feature sets, selection approaches and base solver portfolios. In addition to gaining substantial insights into the utility of the various approaches and techniques, we identified a default configuration of claspfolio 2 that achieves substantial performance gains not only over clasp's default configuration and the earlier version of claspfolio 2, but also over manually tuned configurations of clasp.
Recommendations
- A tutorial on hybrid answer set solving with \textit{clingo}
- Logic Programming and Nonmonotonic Reasoning
- An Introduction to Answer Set Programming and Some of Its Extensions
- Logic Programming and Nonmonotonic Reasoning
- AI*IA 2005: Advances in Artificial Intelligence
- Answer Set Programming: A Declarative Approach to Solving Search Problems
- \(\mathrm{ASP}(\mathcal{AC})\): answer set programming with algebraic constraints
Cites work
- Extending and implementing the stable model semantics
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Logic programming and nonmonotonic reasoning. 11th international conference, LPNMR 2011, Vancouver, Canada, May 16--19, 2011. Proceedings
- Logic programming and nonmonotonic reasoning. 12th international conference, LPNMR 2013, Corunna, Spain, September 15--19, 2013. Proceedings
- Some (in)translatability results for normal logic programs and propositional theories
Cited in
(27)- On the impact of configuration on abstract argumentation automated reasoning
- Efficient benchmarking of algorithm configurators via model-based surrogates
- Dynamic branching in qualitative constraint-based reasoning via counting local models
- Boosting evolutionary algorithm configuration
- The algorithm selection competitions 2015 and 2017
- claspfolio 2
- Deep learning for the generation of heuristics in answer set programming: a case study of graph coloring
- A machine learning system to improve the performance of ASP solving based on encoding selection
- ASlib: a benchmark library for algorithm selection
- Progress in clasp series 3
- Multi-level Algorithm Selection for ASP
- Multi-engine ASP solving with policy adaptation
- aspeed: solver scheduling via answer set programming
- Combining answer set programming and domain heuristics for solving hard industrial problems (application paper)
- Technical note. Efficiently coupling the \(\mathscr{I}\)-DLV grounder with ASP solvers
- scientific article; zbMATH DE number 7453100 (Why is no real title available?)
- scientific article; zbMATH DE number 7453125 (Why is no real title available?)
- scientific article; zbMATH DE number 7453149 (Why is no real title available?)
- scientific article; zbMATH DE number 7455711 (Why is no real title available?)
- Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems
- Applying machine learning techniques to ASP solving
- Parallel Logic Programming: A Sequel
- Instance space analysis for the car sequencing problem
- Adaptive large-neighbourhood search for optimisation in answer-set programming
- System predictor: grounding size estimator for logic programs under answer set semantics
- On the configuration of more and less expressive logic programs
- Frugal algorithm selection for combinatorial search
This page was built for publication: claspfolio2: Advances in Algorithm Selection for Answer Set Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931265)
