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 条
  • [31] Lazy-Grounding for Answer Set Programs with External Source Access
    Eiter, Thomas
    Kaminski, Tobias
    Weinzierl, Antonius
    PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 1015 - 1022
  • [32] Historical Review of Variants of Informal Semantics for Logic Programs under Answer Set Semantics: GL'88, GL'91, GK'14, D-V'12
    Lierler, Yuliya
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2024,
  • [33] Probabilistic Logic Programming under Answer Sets Semantics
    王洁
    鞠实儿
    中山大学学报(社会科学版), 2003, (S1) : 90 - 96
  • [34] Probabilistic Logic Programming under Answer Sets Semantics
    王洁
    鞠实儿
    中山大学学报(社会科学版), 2003, (社会科学版) : 90 - 96
  • [35] A system with template answer set programs
    Calimeri, F
    Ianni, G
    Ielpa, G
    Pietramala, A
    Santoro, MC
    LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, 3229 : 693 - 697
  • [36] Complexity of fuzzy answer set programming under Lukasiewicz semantics
    Blondeel, Marjon, 1971, Elsevier Inc. (55):
  • [37] Complexity of fuzzy answer set programming under Lukasiewicz semantics
    Blondeel, Marjon
    Schockaert, Steven
    Vermeir, Dirk
    De Cock, Martine
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2014, 55 (09) : 1971 - 2003
  • [38] Unfounded Sets and Well-Founded Semantics of Answer Set Programs with Aggregates
    Alviano, Mario
    Calimeri, Francesco
    Faber, Wolfgang
    Leone, Nicola
    Perri, Simona
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2011, 42 : 487 - 527
  • [39] Reducing Answer Set Programs under partial assignments
    Ji, Jianmin
    Wan, Hai
    DATA SCIENCE AND KNOWLEDGE ENGINEERING FOR SENSING DECISION SUPPORT, 2018, 11 : 806 - 813
  • [40] Evaluating Epistemic Logic Programs via Answer Set Programming with Quantifiers
    Faber, Wolfgang
    Morak, Michael
    THIRTY-SEVENTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 37 NO 5, 2023, : 6322 - 6329