Affiliation:
1. Institute of Logic and Computation, TU Wien, Austria
Abstract
In this paper, we study conditional preferences in abstract argumentation by introducing a new generalization of Dung-style argumentation frameworks (AFs) called Conditional Preference-based AFs (CPAFs). Each subset of arguments in a CPAF can be associated with its own preference relation. This generalizes existing approaches for preference-handling in abstract argumentation, and allows us to reason about conditional preferences in a general way. We conduct a principle-based analysis of CPAFs and compare them to related generalizations of AFs. Specifically, we highlight similarities and differences to Modgil’s Extended AFs and show that our formalism can capture Value-based AFs. Moreover, we show that in some cases the introduction of conditional preferences leads to an increase in computational complexity.
Subject
Artificial Intelligence,Computational Mathematics,Computer Science Applications,Linguistics and Language
Reference41 articles.
1. G. Alfano, S. Greco, F. Parisi and I. Trubitsyna, On preferences and priority rules in abstract argumentation, in: Proc. IJCAI’22, IJCAI Organization, 2022, pp. 2517–2524.
2. G. Alfano, S. Greco, F. Parisi, I. Trubitsyna et al., Abstract argumentation framework with conditional preferences, in: Proc. AAAI’23, AAAI Press, 2023, pp. 6218–6227.
3. L. Amgoud and C. Cayrol, On the acceptability of arguments in preference-based argumentation, in: Proc. UAI’98, Morgan Kaufmann, 1998, pp. 1–7.
4. A reasoning model based on the production of acceptable arguments;Amgoud;Ann. Math. Artif. Intell.,2002
5. On bipolarity in argumentation frameworks;Amgoud;Int. J. Intell. Syst.,2008