Stepwise debugging of answer-set programs*

  title={Stepwise debugging of answer-set programs*},
  author={Johannes Oetsch and J{\"o}rg P{\"u}hrer and Hans Tompits},
  journal={Theory and Practice of Logic Programming},
  pages={30 - 80}
Abstract We introduce a stepping methodology for answer-set programming (ASP) that allows for debugging answer-set programs and is based on the stepwise application of rules. Similar to debugging in imperative languages, where the behaviour of a program is observed during a step-by-step execution, stepping for ASP allows for observing the effects that rule applications have in the computation of an answer set. While the approach is inspired from debugging in imperative programming, it is… 

Witnesses for Answer Sets of Logic Programs

This paper proposes a notion of reduct for disjunctive logic programs, shows that for each answer set, its reduct provides a resolution proof for each atom in it, and finds that for many well-known ASP and SAT benchmarks, computing a minimal witness for an atom of an answer set is often feasible.

Faceted Answer-Set Navigation

This work proposes a general formal framework that takes an arbitrary logic program as input, and allows for navigating the space of answer-sets in a systematic interactive way analogous to faceted browsing, and formulate two navigation modes, one stringent conflict avoiding, and a “free” mode, where conflicting selections of facets might occur.

Answering the “why” in answer set programming – A survey of explanation approaches

An overview of approaches that provide an answer to the question of why an answer set is a solution to a given problem, notably off-line justifications, causal graphs, argumentative explanations, and why-not provenance are given, and highlight their similarities and differences.

Rushing and Strolling among Answer Sets - Navigation Made Easy

A formal and general framework for interactive navigation toward desired subsets of answer sets analogous to faceted browsing that enables the user to explore the solution space by consciously zooming in or out of sub-spaces of solutions at a certain configuration pace.

\mathsf Uhura : An Authoring Tool for Specifying Answer-Set Programs Using Controlled Natural Language

The tool \(\mathsf {Uhura}\) is aimed for supporting users not familiar with answer-set programming—or logic-based approaches in general—for developing programs by means of specifying problem descriptions in a controlled natural language which then are translated into answer- set programming (ASP) rules.

exp(ASPc) : Explaining ASP Programs with Choice Atoms and Constraint Rules

This work presents an enhancement of exp(ASP), a system that generates explanation graphs for a literal l given an answer set A of a normal logic program P, which explain why l is true (or false) given A and P .

Taking stock of available technologies for compliance checking on first-order knowledge

This paper formalizes a selected use case in the considered reasoners and compares the implementations, highlighting that lot of further research still need to be done to integrate the benefits featured by the different reasoners into a single standardized first-order framework.

Justifications for Description Logic Knowledge Bases Under the Fixed-Domain Semantics

Three approaches are compared: one using standard OWL technology employing an axiomatization of the fixed-domain semantics, one using the authors' dedicated fixed- domain reasoner Wolpertinger in combination with standard justification computation technology, and one where the problem is encoded entirely into answer-set programming.

Introduction to the TPLP Special Issue on User-oriented Logic Programming and Reasoning Paradigms

With the rise of machine learning, and more recently the overwhelming interest in deep learning, knowledge representation and reasoning (KRR) approaches struggle to maintain their position within the



A Meta-Programming Technique for Debugging Answer-Set Programs

This paper introduces a meta-programming technique for debugging in ASP that respects the declarative nature of ASP, and the capabilities of the system can easily be extended to incorporate differing debugging features.

Catching the Ouroboros: On debugging non-ground answer-set programs

This paper addresses the central debugging question why some interpretation is not an answer set, using a uniform encoding of a debugging request in terms of ASP itself, and discusses a debugging technique directly geared towards non-ground programs.

Debugging ASP Programs by Means of ASP

This paper proposes a novel methodology, which rests within ASP itself, to sort out errors on the conceptual level, which makes use of tagging, where the program to be analyzed is rewritten using dedicated control atoms.

spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics

The system spock is presented, a debugging support tool for answer-set programs making use of ASP itself and the implemented techniques maintain the declarative nature of ASP within the debugging process and are independent of the actual computation of answer sets.

Debugging ASP using ILP

Inductive logic programming (ILP) along with examples of (un)desirable properties of answer sets can be used to revise the original program semi-automatically so that it satisfies the stated properties, in effect providing debugging-by-example for programs under answer set semantics.

Debugging Answer-Set Programs with Ouroboros - Extending the SeaLion Plugin

A tool, called Ouroboros, for debugging non-ground answer-set programs, which builds on a previous approach based on ASP meta-programming that has been recently extended to cover weight constraints and choice rules.

Debugging Inconsistent Answer Set Programs

This paper addresses one part of ASP debugging, finding the reason why a program does not have any answer sets at all, and creates a prototype for the ASP debugger that is itself implemented using ASP.

Stepwise Debugging of Description-Logic Programs

A framework for interactive stepping through a DL-program as a means for debugging which builds on recent results on stepping for standard answer-set programs is introduced and the well-known notion of an unfounded set forDL-programs is extended.

Interactive Query-Based Debugging of ASP Programs

This paper presents an interactive query-based ASP debugging method which extends previous approaches and finds the preferred explanation by means of observations and discusses query selection strategies which - given user's preferences for an explanation - can find the most informative query reducing the overall number of queries required for the identification of a preferred explanation.

"That is illogical, Captain!" : the debugging support tool spock for answer-set programs ; system description

The system spock is described, a debugging support tool for answer-set programs making use of ASP itself and the implemented techniques maintain the declarative nature of ASP within the debugging process and are independent from the actual computation of answer sets.