Search
 
loader loading subjects...
cover
Serialisable Semantics for Abstract Argumentation
Lars Bengel, Matthias Thimm
80 - 91
10.3233/FAIA220143
Research Article
Frontiers in Artificial Intelligence and Applications
Volume 353: Computational Models of Argument
Abstract

We investigate the recently proposed notion of serialisability of semantics for abstract argumentation frameworks. This notion describes semantics where the construction of extensions can be serialised through iterative addition of minimal non-empty admissible sets. We investigate general relationships between serialisability and other principles from the literature. We also investigate the novel unchallenged semantics as a new instance of a serialisable semantics and, in particular, analyse it in terms of satisfied principles and computational complexity.

Download
Creative Commons License