TY - JOUR
T1 - Argumentation Frameworks Induced by Assumption-Based Argumentation
T2 - 20th International Workshop on Non-Monotonic Reasoning
AU - Rapberger, Anna
AU - Ulbricht, Markus
AU - Wallner, Johannes P.
N1 - Funding Information:
We thank the anonymous reviewers of this paper for their helpful comments. This research was funded in whole, or in part, by the Austrian Science Fund (FWF) W1255-N23, by the Vienna Science and Technology Fund (WWTF) through project ICT19-065, and by the German Federal Ministry of Education and Research (BMBF, 01/S18026AF) by funding the competence center for Big Data and AI “ScaDS.AI” Dresden/Leipzig.
Publisher Copyright:
© 2022 Copyright for this paper by its authors.
PY - 2022
Y1 - 2022
N2 - A key ingredient of computational argumentation in AI is the generation of arguments in favor or against claims under scrutiny. In this paper we look at the complexity of the argument generation procedure in the prominent structured formalism of assumption-based argumentation (ABA). We show several results connecting expressivity of ABA fragments and number of constructed arguments. First, for several NP-hard fragments of ABA, the number of generated arguments is not bounded polynomially. Even under equivalent rewritings of the given ABA framework there are situations where one cannot avoid an exponential blow-up. We establish a weaker notion of equivalence under which this blow-up can be avoided. As a general tool for analyzing ABA frameworks and resulting arguments and their conflicts, we extend results regarding dependency graphs of ABA frameworks, from which one can infer structural properties on the induced attacks among arguments.
AB - A key ingredient of computational argumentation in AI is the generation of arguments in favor or against claims under scrutiny. In this paper we look at the complexity of the argument generation procedure in the prominent structured formalism of assumption-based argumentation (ABA). We show several results connecting expressivity of ABA fragments and number of constructed arguments. First, for several NP-hard fragments of ABA, the number of generated arguments is not bounded polynomially. Even under equivalent rewritings of the given ABA framework there are situations where one cannot avoid an exponential blow-up. We establish a weaker notion of equivalence under which this blow-up can be avoided. As a general tool for analyzing ABA frameworks and resulting arguments and their conflicts, we extend results regarding dependency graphs of ABA frameworks, from which one can infer structural properties on the induced attacks among arguments.
UR - http://www.scopus.com/inward/record.url?scp=85137540279&partnerID=8YFLogxK
M3 - Conference article
AN - SCOPUS:85137540279
SN - 1613-0073
VL - 3197
SP - 92
EP - 103
JO - CEUR Workshop Proceedings
JF - CEUR Workshop Proceedings
Y2 - 7 August 2022 through 9 August 2022
ER -