Catching the Ouroboros: On debugging non-ground answer-set programs
From MaRDI portal
Publication:3585165
DOI10.1017/S1471068410000256zbMATH Open1213.68182arXiv1007.4986OpenAlexW3101739347MaRDI QIDQ3585165
Jörg Pührer, Johannes Oetsch, Hans Tompits
Publication date: 19 August 2010
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Abstract: An important issue towards a broader acceptance of answer-set programming (ASP) is the deployment of tools which support the programmer during the coding phase. In particular, methods for debugging an answer-set program are recognised as a crucial step in this regard. Initial work on debugging in ASP mainly focused on propositional programs, yet practical debuggers need to handle programs with variables as well. In this paper, we discuss a debugging technique that is directly geared towards non-ground programs. Following previous work, we address the central debugging question why some interpretation is not an answer set. The explanations provided by our method are computed by means of a meta-programming technique, using a uniform encoding of a debugging request in terms of ASP itself. Our method also permits programs containing comparison predicates and integer arithmetics, thus covering a relevant language class commonly supported by all state-of-the-art ASP solvers.
Full work available at URL: https://arxiv.org/abs/1007.4986
Cites Work
Cited In (16)
- Generating explanations for biomedical queries
- Omission-Based Abstraction for Answer Set Programs
- Interactive Debugging of Non-ground ASP Programs
- Stepwise debugging of answer-set programs
- Abstraction for non-ground answer set programs
- Debugging Non-ground ASP Programs: Technique and Graphical Tools
- ASP and subset minimality: enumeration, cautious reasoning and MUSes
- Answering the “why” in answer set programming – A survey of explanation approaches
- Characterising and Explaining Inconsistency in Logic Programs
- Finding explanations of inconsistency in multi-context systems
- Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming
- Witnesses for Answer Sets of Logic Programs
- Enablers and Inhibitors in Causal Justifications of Logic Programs
- Stepwise Debugging of Description-Logic Programs
- On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation
- Contrastive explanations for answer-set programs
Uses Software
This page was built for publication: Catching the Ouroboros: On debugging non-ground answer-set programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3585165)