Labelling

A labelling is a total function L ⁣:A→{in,out,undec}L \colon A \to \{\mathsf{in}, \mathsf{out}, \mathsf{undec}\}; an argument aa is accepted, rejected, or undecided in LL if L(a)L(a) is in\mathsf{in}, out\mathsf{out}, or undec\mathsf{undec}, respectively.

Reference

Caminada, M. & Gabbay, D.M. (2009). A Logical Account of Formal Argumentation. Studia Logica, 93, pp. 109–145.

Referenced by