Probabilistic Ranking

The probabilistic ranking associates to any AF FF a ranking ⪰Fθσ,∘p\succeq^{\theta^p_{\sigma,\circ}}_F on AA such that ∀a,b∈A\forall a,b \in A: a⪰Fθσ,∘pba \succeq^{\theta^p_{\sigma,\circ}}_F b iff Pσ,∘(a)≥Pσ,∘(b)P_{\sigma,\circ}(a) \geq P_{\sigma,\circ}(b) in the PAF F[p]F[p] that gives every argument probability p∈(0,1)p \in (0,1) and every attack probability 11. Here Pσ,∘P_{\sigma,\circ} is the credulous (∘=c\circ = c) or skeptical (∘=s\circ = s) acceptance probability under a semantics σ\sigma.

Reference

Thimm, M., Cerutti, F. & Rienstra, T. (2018). Probabilistic Graded Semantics. In: Computational Models of Argument (COMMA 2018), FAIA 305, pp. 369–380. IOS Press.