Equivalence of Semantics in Argumentation

A large number of evaluation methods, called semantics, have been proposed in the literature for assessing strength of arguments. This paper investigates their equivalence.

It argues that for being equivalent, two semantics should have compatible evaluations of both individual arguments and pairs of arguments. The first requirement ensures that the

two semantics judge an argument in the same way, while the second states that they provide the same ranking of arguments. We show that the two requirements are completely independent.

The paper introduces three novel relations between semantics based on their rankings of arguments: weak equivalence, strong equivalence and refinement.

They state respectively that two semantics do not disagree on their strict rankings; the rankings of the semantics coincide; one semantics agrees with the strict

comparisons of the second and it may break some of its ties. We investigate the properties of the three relations and their links with existing

principles of semantics, and study the nature of relations between most of the existing semantics. The results show that the main extensions semantics are pairwise weakly equivalent.

The gradual semantics we considered are pairwise incompatible, however some pairs are strongly equivalent in case of flat graphs including Max-based (Mbs)

and Euler-based (Ebs), for which we provide full characterizations in terms respectively of Fibonacci numbers and the numbers of an exponential series.

Furthermore, we show that both semantics (Mbs, EMbs) refine the grounded semantics, and are weakly equivalent with the other extension semantics.

We show also that in case of flat graphs, the two gradual semantics Trust-based and Iterative Schema characterize the grounded semantics,

making thus bridges between gradual semantics and extension semantics. Finally, the other gradual semantics are incompatible with extension semantics.