Stepping through an Answer-Set Program

Oetsch, Johannes; Pührer, Jörg; Tompits, Hans

doi:10.1007/978-3-642-20895-9_13

Cited by 23 publications

(17 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Fourth, our approach is related to debugging of ASP [14], [31]. Unlike SkASP such debuggers can be used to locate bugs, but typically do not provide help in fixing them.…”

Section: Related Workmentioning

confidence: 99%

Sketched Answer Set Programming

Paramonov

Bessière

Dries

et al. 2018

2018 IEEE 30th International Conference on Tools With Artificial Intelligence (ICTAI)

View full text Add to dashboard Cite

Answer Set Programming (ASP) is a powerful modeling formalism for combinatorial problems. However, writing ASP models can be hard. We propose a novel method, called Sketched Answer Set Programming (SkASP), aimed at facilitating this. In SkASP, the user writes partial ASP programs, in which uncertain parts are left open and marked with question marks. In addition, the user provides a number of positive and negative examples of the desired program behaviour. SkASP then synthesises a complete ASP program. This is realized by rewriting the SkASP program into another ASP program, which can then be solved by traditional ASP solvers. We evaluate our approach on 21 well known puzzles and combinatorial problems inspired by Karps 21 NP-complete problems and on publicly available ASP encodings.Index Terms-inductive logic programming, constraint learning, answer set programming, sketching, constraint programming, relational learning [SKETCH] 2

show abstract

“…Fourth, our approach is related to debugging of ASP [14], [31]. Unlike SkASP such debuggers can be used to locate bugs, but typically do not provide help in fixing them.…”

Section: Related Workmentioning

confidence: 99%

Sketched Answer Set Programming

Paramonov

Bessière

Dries

et al. 2018

2018 IEEE 30th International Conference on Tools With Artificial Intelligence (ICTAI)

View full text Add to dashboard Cite

show abstract

“…One core feature that is already under development is the support for stepping-based debugging of answer-set programs as introduced in recent work [26]. Here, we aim for an intuitive and easy-to-handle user interface, which is clearly a challenge to achieve for reasons intrinsic to ASP.…”

Section: Projected Featuresmentioning

confidence: 99%

The SeaLion has Landed: An IDE for Answer-Set Programming—Preliminary Report

Oetsch

Pührer

Tompits

2013

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

We report about the current state and designated features of the tool SeaLion, aimed to serve as an integrated development environment (IDE) for answer-set programming (ASP). A main goal of SeaLion is to provide a user-friendly environment for supporting a developer to write, evaluate, debug, and test answer-set programs. To this end, new support techniques have to be developed that suit the requirements of the answer-set semantics and meet the constraints of practical applicability. In this respect, SeaLion benefits from the research results of a project on methods and methodologies for answer-set program development in whose context SeaLion is realised. Currently, the tool provides source-code editors for the languages of Gringo and DLV that offer syntax highlighting, syntax checking, and a visual program outline. Further implemented features are support for external solvers and visualisation as well as visual editing of answer sets. SeaLion comes as a plugin of the popular Eclipse platform and provides itself interfaces for future extensions of the IDE.

show abstract

“…As noted in the introduction, our approach builds on ideas of previous work on stepping for normal logic programs under the answer-set semantics [4]. To illustrate the basic idea of stepping, we first briefly discuss the intuitions of the previous stepping approach.…”

Section: A Stepping Framework For Dl-programsmentioning

confidence: 99%

“…The idea of stepping, adapted in this paper for DL-programs, was initially introduced for normal logic programs [4]. Other debugging methods related to stepping are, on the one hand, finding reasons why some interpretation is not an answer set of a program by identifying unfounded loops or unsatisfied rules [12] and, on the other hand, explaining why a program yields no answer sets at all by means of pinpointing unintentionally active constraints [16].…”

Section: Related Workmentioning

confidence: 99%

“…As DL-programs have a genuine declarative semantics lacking any control flow, it is not obvious how stepping can be realised. Our approach builds on recent results on stepping of standard logic programs under the answer-set semantics [4]. Similar to that approach, we introduce a computation model for DLprograms that is based on states which represent the ground DL-rules that a user considers as active in the program and the resulting intermediate interpretation.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Stepwise Debugging of Description-Logic Programs

2012

Self Cite

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

Stepping through an Answer-Set Program

Cited by 23 publications

References 10 publications

Sketched Answer Set Programming

Sketched Answer Set Programming

The SeaLion has Landed: An IDE for Answer-Set Programming—Preliminary Report

Stepwise Debugging of Description-Logic Programs

Contact Info

Product

Resources

About