System Predictor: Grounding Size Estimator for Logic Programs under Answer Set Semantics

被引：0
|
作者：
Bresnahan, Daniel [1 ]
Hippen, Nicholas [1 ]
Lierler, Yuliya [1 ]
机构：
[1] Univ Nebraska Omaha, Omaha, NE 68182 USA
来源：
THEORY AND PRACTICE OF LOGIC PROGRAMMING | 2024年 / 24卷 / 01期
关键词：
answer set programming; encoding optimizations; DESIGN;
D O I：
10.1017/S1471068423000078
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
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.
引用
收藏
页码：132 / 156
页数：25
相关论文
共 50 条
  • [41] SMODELSA -: A system for computing answer sets of logic programs
    Elkabani, I
    Pontelli, E
    Son, TC
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING, 2005, 3662 : 427 - 431
  • [42] Logic Programs under Three-Valued Lukasiewicz Semantics
    Hoelldobler, Steffen
    Ramli, Carroline Dewi Puspa Kencana
    LOGIC PROGRAMMING, 2009, 5649 : 464 - 478
  • [43] Testing the equivalence of logic programs under stable model semantics
    Janhunen, T
    Oikaxinen, E
    LOGICS IN ARTIFICIAL INTELLIGENCE 8TH, 2002, 2424 : 493 - 504
  • [44] Semantics for possibilistic answer set programs: Uncertain rules versus rules with uncertain conclusions
    Bauters, Kim
    Schockaert, Steven
    De Cock, Martine
    Vermeir, Dirk
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2014, 55 (02) : 739 - 761
  • [45] Uniform equivalence of logic programs under the stable model semantics
    Eiter, T
    Fink, M
    LOGIC PROGRAMMING, PROCEEDINGS, 2003, 2916 : 224 - 238
  • [46] Expressiveness of Logic Programs under the General Stable Model Semantics
    Zhang, Heng
    Zhang, Yan
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2017, 18 (02)
  • [47] On the Development of PASTA: Inference in Probabilistic Answer Set Programming under the Credal Semantics
    Azzolini, Damiano
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2023, (385):
  • [48] Algebraic semantics of a system of logic based on a finite ordered set
    Nour, A
    MATHEMATICAL LOGIC QUARTERLY, 1999, 45 (04) : 457 - 466
  • [49] The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics
    Alviano, Mario
    Faber, Wolfgang
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING (LPNMR 2013), 2013, 8148 : 67 - 72
  • [50] Strong equivalence of logic programs under the infinite-valued semantics
    Nomikos, Christos
    Rondogiannis, Panos
    Wadge, William W.
    INFORMATION PROCESSING LETTERS, 2009, 109 (11) : 576 - 581
12345