STSM WG4 (Francesco Santini)

Start Date: 2010-08-14

End Date: 2010-08-21

Host Institution: Universidade Nova de Lisboa

Host Country: Portugal

Home Institution: UniversitĂ  di Perugia

Home Country: Italy


The visit the study of optimization techniques for solving partitions of arguments with Dung’s Properties via Soft Constraint Satisfaction Problems. The initial set of arguments is partitioned into subsets (or coalitions).
Each coalition represents a different line of thought, but 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). We use (soft) constraints as a formal approach to reason about coalitions and to model all these problems in the same framework. To implement this mapping and practically find its solutions we want to use JaCoP, a Java constraint solver, which needs some optimization in order to speed up the search of the (exponential) number of partitions.

STSM report