mlsanityData to 14 Oct 2026

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

arXiv 2109.08292 ↗First posted 17 Sep 2021cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

We present an enhancement of exp(ASP), a system that generates explanation graphs for a literal l - an atom a or its default negation ~a - given an answer set A of a normal logic program P, which explain why l is true (or false) given A and P. The new system, exp(ASPc), differs from exp(ASP) in that it supports choice rules and utilizes constraint rules to provide explanation graphs that include information about choices and constraints.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 5 of its 18 references that are in the map. First posted on arXiv 17 Sep 2021.

Builds on

5 of 18 references.

References · 5

  1. 2014Justifying Answer Sets using Argumentationcited by 12
  2. 2020A System for Explainable Answer Set Programmingcited by 10
  3. 2017Stepwise Debugging of Answer-Set Programscited by 6
  4. 2016Justifications for Programs with Disjunctive and Causal-choice Rulescited by 1
  5. 2021Generating explanations for answer set programming applicationscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 2; 2024: 0; 2025: 0; 2026: 1.

3 papers.

  1. 2023Explanations for Answer Set Programmingcited by 1
  2. 2023Explainable Answer-set Programmingcited by 1
  3. 2026An XAI View on Explainable ASP: Methods, Systems, and Perspectivescited by 0