Serialisable Semantics
Builds extensions step by step: starting from the empty set, it repeatedly adds an initial set chosen by the selection function and continues in the reduct. Every set reached that the termination function accepts is an extension.
Reference
Thimm, M. (2022). Revisiting Initial Sets in Abstract Argumentation. Argument & Computation, 13(3), pp. 325–360.