Computational strategies for trust-aware abstract argumentation frameworks

The Trust-aware Abstract Argumentation Frameworks (T-AAFs) have been proposed in [18] as a variant of the well-known abstract argumentation frameworks where the trustworthiness of the agents participating the dispute is taken into account. In particular, T-AAFs consist in AAFs where arguments are associated with weights derived from the trust degrees of the agents proposing them. [18] studies the problem min-Tver (resp., min-Tacc) of computing the minimum trust degree τ∗ such that, if the arguments said only by agents whose trust degree is not greater than τ∗ are discarded, a given set of arguments S (resp., argument a), that is not necessarily an extension (resp., (credulously) accepted) over the original argumentation framework, becomes an extension (resp., (credulously) accepted). We extend the proposal in [18] by devising suitable methods for solving the problems min-Tver and min-Tacc. Specifically, we provide a translation for the intractable cases of min-Tver and min-Tacc into instances of Integer Linear Programming (ILP), so that they can be solved by resorting to standard ILP solvers.