claspfolio 2: Advances in Algorithm Selection for Answer Set Programming
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 May 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 3; 2023: 2; 2024: 1; 2025: 1.
8 papers.
- 2021Parallel Logic Programming: A Sequelcited by 3
- 2023Revisit the Algorithm Selection Problem for TSP with Spatial Information Enhanced Graph Neural Networkscited by 3
- 2022Efficient lifting of symmetry breaking constraints for complex combinatorial problemscited by 2
- 2022Specifying and Exploiting Non-Monotonic Domain-Specific Declarative Heuristics in Answer Set Programmingcited by 2
- 2022On the Configuration of More and Less Expressive Logic Programscited by 1
- 2023System Predictor: Grounding Size Estimator for Logic Programs under Answer Set Semanticscited by 0
- 2024Frugal Algorithm Selectioncited by 0
- 2025Improving ASP-based ORS Schedules through Machine Learning Predictionscited by 0
- 2025Improving ASP-based ORS Schedules through Machine Learning Predictions22 Jul 2025
- 2024Frugal Algorithm Selection17 May 2024
- 2023System Predictor: Grounding Size Estimator for Logic Programs under Answer Set Semantics29 Mar 2023
- 2023Revisit the Algorithm Selection Problem for TSP with Spatial Information Enhanced Graph Neural Networks8 Feb 2023
- 2022Specifying and Exploiting Non-Monotonic Domain-Specific Declarative Heuristics in Answer Set Programming19 Sep 2022
- 2022Efficient lifting of symmetry breaking constraints for complex combinatorial problems14 May 2022
- 2022On the Configuration of More and Less Expressive Logic Programs2 Mar 2022
- 2021Parallel Logic Programming: A Sequel22 Nov 2021