System Predictor: Grounding Size Estimator for Logic Programs under Answer Set Semantics
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 perf...
Gespeichert in:
Veröffentlicht in: | Theory and practice of logic programming 2024-01, Vol.24 (1), p.132-156 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
ISSN: | 1471-0684 1475-3081 |
DOI: | 10.1017/S1471068423000078 |