Justifications for logic programs under answer set semantics

Pontelli, Enrico; Son, Tran Cao; Elkhatib, Omar

doi:10.1017/s1471068408003633

Cited by 58 publications

(35 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…VIDEAS has been implemented on top of the Eclipse platform. 5 In particular, technologies provided by the Eclipse Modeling Framework (EMF) 6 and the Graphical Modeling Framework (GMF) 7 projects have been used. The meta-model representing the ER diagram modelling language has been created using the Ecore modelling language which is specified within the EMF project.…”

Section: Methodsmentioning

confidence: 99%

See 1 more Smart Citation

VIDEAS: A Development Tool for Answer-Set Programs Based on Model-Driven Engineering Technology

Oetsch

Pührer

Seidl

et al. 2011

Logic Programming and Nonmonotonic Reasoning

View full text Add to dashboard Cite

Abstract. In the object-oriented world, much effort is spent into the development of dedicated tools to ease programming and to prevent programming errors. Recently, the techniques of model-driven engineering (MDE) have been proven especially valuable to manage the complexity of modern software systems during the software development process. In the world of answer-set programming (ASP), the situation is different. Much effort is invested into the development of efficient solvers, but the pragmatics of programming itself has not received much attention and more tool support to ease the actual programming phase would be desirable. To address this issue, we introduce the tool VIDEAS which graphically supports the partial specification of answer-set programs, applying technologies provided by MDE.

show abstract

Section: Methodsmentioning

confidence: 99%

“…However, practice has shown that the development of answer-set programs is not always straightforward and that programs are, as all human-made artifacts, prone to errors. In fact, debugging in ASP is currently a quite active research field [1][2][3][4][5][6][7][8][9].…”

Section: Introductionmentioning

confidence: 99%

VIDEAS: A Development Tool for Answer-Set Programs Based on Model-Driven Engineering Technology

Oetsch

Pührer

Seidl

et al. 2011

Logic Programming and Nonmonotonic Reasoning

View full text Add to dashboard Cite

show abstract

“…The notion of computations for stepping is related to work by Pontelli et al [19] who used justifications for similar purposes. Justifications are labelled directed graphs that explain the truth value of a literal l in some answer set in terms of truth values of literals l depends on.…”

Section: Related Workmentioning

confidence: 99%

Stepwise Debugging of Description-Logic Programs

2012

View full text Add to dashboard Cite

Abstract. Description-logic programs (or DL-programs for short) combine logic programs under the answer-set semantics with description logics for semanticweb reasoning. In order for a wider acceptance of the formalism among semanticweb engineers, it is vital to have adequate tools supporting the program development process. In particular, methods for debugging DL-programs are needed. In this paper, we introduce a framework for interactive stepping through a DLprogram as a means for debugging which builds on recent results on stepping for standard answer-set programs. To this end, we provide a computation model for DL-programs using states based on the rules that a user considers as active in the program and the resulting intermediate interpretation. During the course of stepping, the interpretations of the subsequent states evolve towards an answer set of the overall program. Compared to the case of standard answer-set programs, we need more involved notions of states and computations in the presence of DL-atoms. In particular, if non-convex DL-atoms are involved, we have to allow for non-stable computations. Intuitively speaking, we realise this by allowing the user to assume the truth of propositional atoms which must be justified in subsequent states. To keep track of these additional atoms, we extend the well-known notion of an unfounded set for DL-programs.

show abstract

“…Work on debugging in ASP includes justifications for ASP [11]. A justification is a labelled directed graph that explains the truth value of a literal with respect to an answer-set in terms of dependency on the truth values of fellow literals.…”

Section: Related Workmentioning

confidence: 99%

Stepping through an Answer-Set Program

Oetsch

Pührer

Tompits

2011

Logic Programming and Nonmonotonic Reasoning

View full text Add to dashboard Cite

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.

show abstract

Justifications for logic programs under answer set semantics

Cited by 58 publications

References 42 publications

VIDEAS: A Development Tool for Answer-Set Programs Based on Model-Driven Engineering Technology

VIDEAS: A Development Tool for Answer-Set Programs Based on Model-Driven Engineering Technology

Stepwise Debugging of Description-Logic Programs

Stepping through an Answer-Set Program

Contact Info

Product

Resources

About