System Predictor: Grounding Size Estimator for Logic Programs under Answer Set Semantics
-
Published:2023-06-22
Issue:1
Volume:24
Page:132-156
-
ISSN:1471-0684
-
Container-title:Theory and Practice of Logic Programming
-
language:en
-
Short-container-title:Theory and Practice of Logic Programming
Author:
BRESNAHAN DANIEL,
HIPPEN NICHOLAS,
LIERLER YULIYAORCID
Abstract
AbstractAnswer 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.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software
Reference30 articles.
1. Bichler, M. 2015. Optimizing non-ground answer set programs via rule decomposition. Bachelor Thesis, TU Wien.
2. Consistency of Clark’s completion and existence of stable models;Fages;Journal of Methods of Logic in Computer Science,1994
3. Optimizing Answer Set Computation via Heuristic-Based Decomposition
4. Challenges in Answer Set Solving
5. claspfolio 2: Advances in algorithm selection for answer set programming;Hoos;TPLP,2014