A Ranking Semantics for Abstract Argumentation Based on Serialisability

We revisit the foundations of ranking semantics for abstract argumentation frameworks by observing that most existing approaches are incompatible with classical extension-based semantics. In particular, most ranking semantics violate the principle of admissibility, meaning that admissible arguments are not necessarily better ranked than inadmissible arguments. We propose new postulates for capturing said compatibility with classical extension-based semantics and present a new ranking semantics that complies with these postulates. This ranking semantics is based on the recently proposed notion of serialisability that allows to rank arguments according to the number of conflicts needed to be solved in order to include that argument in an admissible set.