Choice logics and their computational properties

Bernreiter, Michael; Maly, Jan; Woltran, Stefan

doi:10.1016/j.artint.2022.103755

Cited by 4 publications

(1 citation statement)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Preferences are of great importance in computer science and artificial intelligence [16,25,39], where research areas such as recommender systems [18], computational social choice [31], and non-monotonic reasoning [15,40] are concerned with the representation and processing of preferences. Moreover, many situations require the use of conditional preferences, where a choice between two options (e.g.…”

Section: Introductionmentioning

confidence: 99%

Abstract argumentation with conditional preferences

Bernreiter

Dvořák

Woltran

2024

AAC

Self Cite

View full text Add to dashboard Cite

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.

show abstract