System Predictor: Grounding Size Estimator for Logic Programs under Answer Set Semantics
Not on the map. Why?
Abstract (arXiv)
Answer set programming is a declarative logic programming paradigm geared towards solving difficult combinatorial search problems. While different logic programs can encode the same problem, their performance may vary significantly. It is not always easy to identify which version of the program performs the best. We present the system Predictor (and its algorithmic backend) for estimating the grounding size of programs, a metric that can influence a performance of a system processing a program. We evaluate the impact of Predictor when used as a guide for rewritings produced by the answer set programming rewriting tools Projector and Lpopt. The results demonstrate potential to this approach.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 8 of its 36 references that are in the map. First posted on arXiv 29 Mar 2023.
Builds on
8 of 36 references.
References · 8
- 2019ASP-Core-2 Input Language Formatcited by 77
- 2021An ASP-based Solution to the Chemotherapy Treatment Scheduling problemcited by 9
- 2014claspfolio 2: Advances in Algorithm Selection for Answer Set Programmingcited by 8
- 2021On the Foundations of Grounding in Answer Set Programmingcited by 6
- 2018Optimizing Answer Set Computation via Heuristic-Based Decompositioncited by 5
- 2016lpopt: A Rule Optimization Tool for Answer Set Programmingcited by 4
- 2020A Machine Learning guided Rewriting Approach for ASP Logic Programscited by 3
- 2014The Multi-engine ASP Solver ME-ASP: Progress Reportcited by 1
Built on by
Not cited yet.