Argumentative Characterizations of (Extended) Disjunctive Logic Programs

Abstract 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 Bondarenko, Dung, Kowalski and Toni, and of Caminada and Schulz, by showing that assumption-based argumentation can represent not only normal logic programs, but also disjunctive logic programs under the stable model semantics. 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.