Burden Number

The burden number of a∈Aa \in A is the sequence BurF(a)=⟨Bur0(a),Bur1(a),…⟩\mathsf{Bur}_F(a) = \langle \mathsf{Bur}_0(a), \mathsf{Bur}_1(a), \ldots \rangle with Bur0(a)=1\mathsf{Bur}_0(a) = 1 and Buri(a)=1+∑b∈a−1Buri−1(b)\mathsf{Bur}_i(a) = 1 + \sum_{b \in a^-} \frac{1}{\mathsf{Bur}_{i-1}(b)} for i>0i > 0, where a−a^- are the attackers of 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