Termination Function

A termination function is any function $\beta$ that maps each serialisation state $(F, E)$ , with $F$ the current reduct and $E$ the set of arguments selected so far, to $\{0,1\}$ ; $\beta(F,E) = 1$ means the construction may end in this state.

Reference

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

Referenced by

Serialisable Semantics
Serialisation Graph
Serialisation System
Admissible Termination Function
Complete Termination Function
Preferred Termination Function
Stable Termination Function
Unchallenged Termination Function
Serialisability