Serialisation Sequence

A serialisation sequence is a sequence (S1,…,Sn)(S_1, \ldots, S_n) such that S1S_1 is an initial set of FF and each SiS_i with 2≤i≤n2 \le i \le n is an initial set of the reduct FS1∪…∪Si−1F^{S_1 \cup \ldots \cup S_{i-1}}.

Remarks

A non-empty set is admissible iff it is the union S1∪…∪SnS_1 \cup \ldots \cup S_n of some serialisation sequence (Thimm, 2022).

Reference

Blümel, L. & Thimm, M. (2022). A Ranking Semantics for Abstract Argumentation Based on Serialisability. In: Computational Models of Argument (COMMA 2022), FAIA 353, pp. 104–115. IOS Press.

Referenced by