AgonProject › Glossary › Principles

Serialisability

A semantics σ\sigma satisfies Serialisability iff there are a selection function α\alpha and a termination function β\beta such that σ(F)=\sigma(F) = Eα,β(F)\mathcal{E}_{\alpha,\beta}(F) for every AF FF.

Reference

Thimm, M. (2022). Revisiting Initial Sets in Abstract Argumentation. Argument & Computation, 13(3), pp. 325–360.