Aggregating Alternative Extensions of Abstract Argumentation Frameworks: Preservation Results for Quota Rules

Open Access
Authors
Publication date 2018
Host editors
  • S. Modgil
  • K. Budzynska
  • J. Lawrence
Book title Computational Models of Argument
Book subtitle Proceedings of COMMA 2018
ISBN
  • 9781614999058
ISBN (electronic)
  • 9781614999065
Series Frontiers in Artificial Intelligence and Applications
Event COMMA 2018
Pages (from-to) 425-436
Publisher Amsterdam: IOS Press
Organisations
  • Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
Abstract
When confronted with the same abstract argumentation framework, specifying a set of arguments and an attack-relation between them, different agents may disagree on which arguments to accept, i.e., they may choose different extensions. In the context of designing systems to support collective argumentation, we may then wish to aggregate such alternative extensions into a single extension that appropriately reflects the views of the group as a whole. Focusing on a conceptually and computationally simple family of aggregation rules, the quota rules, we analyse under what circumstances relevant properties of extensions shared by all extensions reported by the individual agents will be preserved under aggregation. The properties we consider are the classical properties of argumentation semantics, such as being a conflict-free, a complete, or a preferred extension. We show that, while for some properties there are quota rules that guarantee their preservation, for the more demanding properties it is impossible to do so in general.
Document type Conference contribution
Language English
Published at https://doi.org/10.3233/978-1-61499-906-5-425
Downloads
FAIA305-0425 (Final published version)
Permalink to this page
Back