Discussion Count

The discussion count of a∈Aa \in A is the sequence DF(a)=⟨−∣P1F(a)∣,∣P2F(a)∣,−∣P3F(a)∣,…⟩\mathsf{D}^F(a) = \langle -|\mathsf{P}^F_1(a)|, |\mathsf{P}^F_2(a)|, -|\mathsf{P}^F_3(a)|, \ldots \rangle, where PiF(a)\mathsf{P}^F_i(a) is the set of attack paths (bi,…,b1,a)(b_i, \ldots, b_1, a) of length ii ending in aa.

Reference

Amgoud, L. & Ben-Naim, J. (2013). Ranking-Based Semantics for Argumentation Frameworks. In: Scalable Uncertainty Management (SUM 2013), LNCS 8078, pp. 134–147. Springer.

Referenced by