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 条
  • [31] Towards implementations for advanced equivalence checking in answer-set programming
    Tompits, H
    Woltran, S
    LOGIC PROGRAMMING, PROCEEDINGS, 2005, 3668 : 189 - 203
  • [32] Enhancing Lazy Grounding with Lazy Normalization in Answer-Set Programming
    Bomanson, Jori
    Janhunen, Tomi
    Weinzierl, Antonius
    THIRTY-THIRD AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FIRST INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / NINTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2019, : 2694 - 2702
  • [33] TOWARDS A GENERAL ARGUMENTATION SYSTEM BASED ON ANSWER-SET PROGRAMMING
    Gaggl, Sarah Alice
    TECHNICAL COMMUNICATIONS OF THE 26TH INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING (ICLP'10), 2010, 7 : 265 - 269
  • [34] Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There
    Fink, Michael
    LOGIC PROGRAMMING, PROCEEDINGS, 2008, 5366 : 99 - 113
  • [35] Towards Lazy Grounding with Lazy Normalization in Answer-Set Programming
    Bomanson, Jori
    Janhunen, Tomi
    Weinzierl, Antonius
    SIXTEENTH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2018, : 625 - 626
  • [36] Catching the Ouroboros: On debugging non-ground answer-set programs
    Oetsch, Johannes
    Puehrer, Joerg
    Tompits, Hans
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2010, 10 : 513 - 529
  • [37] Blending Lazy-Grounding and CDNL Search for Answer-Set Solving
    Weinzierl, Antonius
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING, LPNMR 2017, 2017, 10377 : 191 - 204
  • [38] Equivalence between answer-set programs under (partially) fixed input
    Bliem, Bernhard
    Woltran, Stefan
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2018, 83 (3-4) : 277 - 295
  • [39] Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling
    Eiter, Thomas
    Geibinger, Tobias
    Musliu, Nysret
    Oetsch, Johannes
    Skocovsky, Peter
    Stepanova, Daria
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2023, 23 (06) : 1281 - 1306
  • [40] Answer-set programming based dynamic user modeling for recommender systems
    Leite, Joao
    Ilic, Manoela
    PROGRESS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2007, 4874 : 29 - 42