# Argumentative Characterizations of (Extended) Disjunctive Logic Programs

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

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 4 of its 75 references that are in the map.
- First posted on arXiv 12 Jun 2023.

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

- [Justifying Answer Sets using Argumentation](https://mlsanity.com/paper/1411.5635/) (2014)
- [Non-Deterministic Approximation Fixpoint Theory and Its Application in Disjunctive Logic Programming](https://mlsanity.com/paper/2211.17262/) (2022)
- [Reasoning by Cases in Structured Argumentation](https://mlsanity.com/paper/1703.08397/) (2017)
- [Non-deterministic approximation operators: ultimate operators, semi-equilibrium semantics and aggregates (full version)](https://mlsanity.com/paper/2305.10846/) (2023)

## Abstract (arXiv)

This paper continues an established line of research about the relations between argumentation theory, particularly assumption-based argumentation, and different kinds of logic programs. In particular, we extend known result of Caminada, Schultz and Toni by showing that assumption-based argumentation can represent not only normal logic programs, but also disjunctive logic programs and their extensions. For this, we consider some inference rules for disjunction that the core logic of the argumentation frameworks should respect, and show the correspondence to the handling of disjunctions in the heads of the logic programs' rules. Under consideration in Theory and Practice of Logic Programming (TPLP).