Argumentative Characterizations of (Extended) Disjunctive Logic Programs
This is an incremental contribution to the theoretical understanding of relationships between argumentation theory and logic programming, primarily relevant to researchers in computational logic and knowledge representation.
The paper extends prior work by demonstrating that assumption-based argumentation can represent disjunctive logic programs and their extensions, establishing correspondences between inference rules for disjunction in argumentation frameworks and the handling of disjunctions in logic program rules.
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).