Stepping through an answer-set program

Authors:
Johannes Oetsch;Jörg Pührer;Hans Tompits
Affiliations:
Technische Universität Wien, Institut für Informationssysteme, Vienna, Austria;Technische Universität Wien, Institut für Informationssysteme, Vienna, Austria;Technische Universität Wien, Institut für Informationssysteme, Vienna, Austria
Venue:
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Year:
2011

Citing 8
Cited 2

Logic programming and knowledge representation-the A-prolog perspective

Artificial Intelligence
Algorithmic program debugging

Algorithmic program debugging
Justifications for logic programs under answer set semantics

Theory and Practice of Logic Programming
Monotonic Answer Set Programming*

Journal of Logic and Computation
The Second Answer Set Programming Competition

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A meta-programming technique for debugging answer-set programs

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Debugging ASP programs by means of ASP

LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Catching the ouroboros: On debugging non-ground answer-set programs

Theory and Practice of Logic Programming

Stepwise debugging of description-logic programs

Correct Reasoning
Declarative datalog debugging for mere mortals

Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a framework for interactive stepping through an answerset 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.