Author ORCID Identifier

Lierler -

Document Type


Publication Date


Publication Title

Theory and Practice of Logic Programming

First Page


Last Page



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.


This is an open access article that was published through the Open Access Publishing agreement between Cambridge University Press and the University of Nebraska.

This is an open access article that is licensed under the Creative Commons Attribution license. Theory and Practice of Logic Programming , First View , pp. 1 - 25


Creative Commons License

Creative Commons Attribution 4.0 License
This work is licensed under a Creative Commons Attribution 4.0 License.