IIT Home Page CNR Home Page

Coalitions of Arguments: An Approach with Constraint Programming

The aggregation of generic items into coalitions leads to the creation of sets of homogenous entities. In this paper we accomplish this for an input set of arguments, and the result is a partition according to distinct lines of thought, i.e., groups of "coherent" ideas. We extend Dung's Argumentation Framework (AF) in order to deal with coalitions of arguments. The initial set of arguments is partitioned into not-intersected subsets. All the found coalitions show the same property inherited by Dung, e.g., all the coalitions in the partition are admissible (or conflict-free, complete, stable): they are generated according to Dung's principles. Each of these coalitions can be assigned to a different agent. We use Soft Constraint Programming as a formal approach to model and solve such partitions in weighted AFs: semiring algebraic structures can be used to model different optimization criteria for the obtained coalitions. Moreover, we implement and solve the presented problem with JaCoP, a Java constraint solver, and we test the code over a small-world network.

Fundamenta Informaticae, 2013

External authors: Francesco Santini ()
IIT authors:

Stefano Bistarelli

Foto di Stefano Bistarelli

Type: Article in ISI Journal
Field of reference: Computer Science & Engineering
Da pagina 383 a pagina 401

Activity: Sicurezza di dispositivi mobili