# Explanations for Answer Set Programming

arXiv: https://arxiv.org/abs/2308.15879 · HTML: https://mlsanity.com/paper/2308.15879/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 9 of its 31 references that are in the map.
- First posted on arXiv 30 Aug 2023.

## Builds on (most cited first, 9 of 9)

- [ASP-Core-2 Input Language Format](https://mlsanity.com/paper/1911.04326/) (2019)
- [How to build your own ASP-based system?!](https://mlsanity.com/paper/2008.06692/) (2020)
- [Justifications for Goal-Directed Constraint Answer Set Programming](https://mlsanity.com/paper/2009.10238/) (2020)
- [Justifying Answer Sets using Argumentation](https://mlsanity.com/paper/1411.5635/) (2014)
- [A System for Explainable Answer Set Programming](https://mlsanity.com/paper/2009.10242/) (2020)
- [Debugging Non-Ground ASP Programs: Technique and Graphical Tools](https://mlsanity.com/paper/1808.00417/) (2018)
- [exp(ASPc) : Explaining ASP Programs with Choice Atoms and Constraint Rules](https://mlsanity.com/paper/2109.08292/) (2021)
- [DiscASP: A Graph-based ASP System for Finding Relevant Consistent Concepts with Applications to Conversational Socialbots](https://mlsanity.com/paper/2109.08297/) (2021)
- [On Nested Justification Systems (full version)](https://mlsanity.com/paper/2205.04541/) (2022)

## Built on by (most cited first, 1 of 1)

- [Formal Explanations for Neuro-Symbolic AI](https://mlsanity.com/paper/2410.14219/) (2024)

## Abstract (arXiv)

The paper presents an enhancement of xASP, a system that generates explanation graphs for Answer Set Programming (ASP). Different from xASP, the new system, xASP2, supports different clingo constructs like the choice rules, the constraints, and the aggregates such as #sum, #min. This work formalizes and presents an explainable artificial intelligence system for a broad fragment of ASP, capable of shrinking as much as possible the set of assumptions and presenting explanations in terms of directed acyclic graphs.