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
关键词
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 条
  • [1] Justifications for logic programs under answer set semantics
    Pontelli, Enrico
    Son, Tran Cao
    LOGIC PROGRAMMING, PROCEEDINGS, 2006, 4079 : 196 - 210
  • [2] Simplifying logic programs under answer set semantics
    Pearce, D
    LOGIC PROGRAMMING, PROCEEDINGS, 2004, 3132 : 210 - 224
  • [3] Justifications for logic programs under answer set semantics
    Pontelli, Enrico
    Son, Tran Cao
    Elkhatib, Omar
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2009, 9 : 1 - 56
  • [4] Merging Logic Programs under Answer Set Semantics
    Delgrande, James
    Schaub, Torsten
    Tompits, Hans
    Woltran, Stefan
    LOGIC PROGRAMMING, 2009, 5649 : 160 - +
  • [5] Tableau Calculi for Logic Programs under Answer Set Semantics
    Gebser, Martin
    Schaub, Torsten
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2013, 14 (02)
  • [6] Computationally Hard Problems for Logic Programs under Answer Set Semantics
    Shen, Yuping
    Zhao, Xishun
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2024, 25 (04)
  • [7] Tree Decomposition Rewritings for Optimizing Logic Programs under Answer Set Semantics
    Zangari, Jessica
    Calimeri, Francesco
    Perri, Simona
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2019, (306): : 330 - 333
  • [8] Fuzzy description logic programs under the answer set semantics for the semantic web
    Lukasiewicz, Thomas
    FUNDAMENTA INFORMATICAE, 2008, 82 (03) : 289 - 310
  • [9] Fuzzy description logic programs under the answer set semantics for the semantic web
    Lukasiewicz, Thomas
    RULEML 2006: SECOND INTERNATIONAL CONFERENCE ON RULES AND RULE MARKUP LANGUAGES FOR THE SEMANTIC WEB, PROCEEDINGS, 2006, : 89 - 96
  • [10] spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics
    Gebser, Martin
    Puehrer, Joerg
    Schaub, Torsten
    Tompits, Hans
    Woltran, Stefan
    APPLICATIONS OF DECLARATIVE PROGRAMMING AND KNOWLEDGE MANAGEMENT: 17TH INTERNATIONAL CONFERENCE, INAP 2007/21ST WORKSHOP ON LOGIC PROGRAMMING, WLP 2007, 2009, 5437 : 247 - +