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 条
  • [1] Faceted Answer-Set Navigation
    Alrabbaa, Christian
    Rudolph, Sebastian
    Schweizer, Lukas
    RULES AND REASONING (RULEML+RR 2018), 2018, 11092 : 211 - 225
  • [2] On Testing Answer-Set Programs
    Janhunen, Tomi
    Niemela, Ilkka
    Oetsch, Johannes
    Puhrer, Jorg
    Tompits, Hans
    ECAI 2010 - 19TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2010, 215 : 950 - 955
  • [3] On Supporting Strong and Default Negation in Answer-Set Program Updates
    Slota, Martin
    Balaz, Martin
    Leite, Joao
    ADVANCES IN ARTIFICIAL INTELLIGENCE (IBERAMIA 2014), 2014, 8864 : 41 - 53
  • [4] Applying Visible Strong Equivalence in Answer-Set Program Transformations
    Bomanson, Jori
    Janhunen, Tomi
    Niemela, Ilkka
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2020, 21 (04)
  • [5] Explainable Answer-set Programming
    Geibinger, Tobias
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2023, (385): : 423 - 429
  • [6] Annotating answer-set programs in LANA
    De Vos, Marina
    Kisa, Doga Gizem
    Oetsch, Johannes
    Puehrer, Joerg
    Tompits, Hans
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2012, 12 : 619 - 637
  • [7] Answer-Set Programming with Bounded Treewidth
    Jakl, Michael
    Pichler, Reinhard
    Woltran, Stefan
    21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, 2009, : 816 - 822
  • [8] On Solution Correspondences in Answer-Set Programming
    Eiter, Thomas
    Tompits, Hans
    Woltran, Stefan
    19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), 2005, : 97 - 102
  • [9] Stepwise debugging of answer-set programs
    Oetsch, Johannes
    Puehrer, Joerg
    Tompits, Hans
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2018, 18 (01) : 30 - 80
  • [10] Contrastive Explanations for Answer-Set Programs
    Eiter, Thomas
    Geibinger, Tobias
    Oetsch, Johannes
    LOGICS IN ARTIFICIAL INTELLIGENCE, JELIA 2023, 2023, 14281 : 73 - 89