AgonProject › Glossary › AF

Unchallenged Termination Function

The termination function βuc\beta_{\mathsf{uc}} is defined by βuc(F,E)=1\beta_{\mathsf{uc}}(F,E) = 1 iff is↚(F)\mathsf{is}^{\not\leftarrow}(F) ∪\cup is↮(F)\mathsf{is}^{\not\leftrightarrow}(F) =∅= \emptyset.

Reference

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

Referenced by

  • Unchallenged Semantics
  • Serialisation System