Stepping through an Answer-Set Program

被引:0
|
作者
Oetsch, Johannes [1 ]
Puehrer, Joerg [1 ]
Tompits, Hans [1 ]
机构
[1] Vienna Univ Technol, Inst Informat Syst 184 3, A-1040 Vienna, Austria
关键词
answer-set programming; program analysis; debugging; LOGIC PROGRAMS; SEMANTICS;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We introduce a framework for interactive stepping through an answer-set program as a means for debugging. In procedural languages, stepping is a widespread and effective debugging strategy. The idea is to gain insight into the behaviour of a program by executing statement by statement, following the program's control flow. Stepping has not been considered for answer-set programs so far, presumably because of their lack of a control flow. The framework we provide allows for stepwise constructing interpretations following the user's intuition on which rule instances to become active. That is, we do not impose any ordering on the rules but give the programmer the freedom to guide the stepping process. Due to simple syntactic restrictions, each step results in a state that guarantees stability of the intermediate interpretation. We present how stepping can be started from breakpoints as in conventional programming and discuss how the approach can be used for debugging using a running example.
引用
收藏
页码:134 / 147
页数:14
相关论文
共 50 条
  • [21] Explaining Answer-Set Programs with Abstract Constraint Atoms
    Eiter, Thomas
    Geibinger, Tobias
    PROCEEDINGS OF THE THIRTY-SECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2023, 2023, : 3193 - 3202
  • [22] Manifold Answer-Set Programs for Meta-reasoning
    Faber, Wolfgang
    Woltran, Stefan
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING, PROCEEDINGS, 2009, 5753 : 115 - +
  • [23] A Model for Phase Transition of Random Answer-Set Programs
    Wen, Lian
    Wang, Kewen
    Shen, Yi-Dong
    Lin, Fangzhen
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2016, 17 (03)
  • [24] Beyond Uniform Equivalence between Answer-set Programs
    Oetsch, Johannes
    Seidl, Martina
    Tompits, Hans
    Woltran, Stefan
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2021, 22 (01)
  • [25] Improved answer-set programming encodings for abstract argumentation
    Gaggl, Sarah A.
    Manthey, Norbert
    Ronca, Alessandro
    Wallner, Johannes P.
    Woltran, Stefan
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2015, 15 : 434 - 448
  • [26] The system Kato: Detecting cases of plagiarism for answer-set programs
    Oetsch, Johannes
    Puehrer, Joerg
    Schwengerer, Martin
    Tompits, Hans
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2010, 10 : 759 - 775
  • [27] ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming
    Egly, Uwe
    Gaggl, Sarah Alice
    Woltran, Stefan
    LOGIC PROGRAMMING, PROCEEDINGS, 2008, 5366 : 734 - 738
  • [28] Large-Neighbourhood Search for Optimisation in Answer-Set Solving
    Eiter, Thomas
    Geibinger, Tobias
    Ruiz, Nelson Higuera
    Musliu, Nysret
    Oetsch, Johannes
    Stepanova, Daria
    THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / THE TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2022, : 5616 - 5625
  • [29] Debugging Answer-Set Programs with Ouroboros - Extending the SeaLion Plugin
    Fruehstueck, Melanie
    Puehrer, Joerg
    Friedrich, Gerhard
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING (LPNMR 2013), 2013, 8148 : 323 - 328
  • [30] Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence
    Puehrer, Joerg
    Tompits, Hans
    Woltran, Stefan
    LOGIC PROGRAMMING, PROCEEDINGS, 2008, 5366 : 561 - 575