|
Abstract Dialectical Frameworks| old_uid | 9422 |
|---|
| title | Abstract Dialectical Frameworks |
|---|
| start_date | 2010/12/13 |
|---|
| schedule | 15h30 |
|---|
| online | no |
|---|
| location_info | Salle A707 |
|---|
| summary | In this talk we discuss abstract dialectical frameworks (ADFs), a powerful generalization of Dung-style argumentation frameworks where each node comes with an associated acceptance condition. This allows us to model di fferent types of dependencies, e.g. support and attack, as well as diff erent types of nodes within a single framework. We show that Dung's standard semantics can be generalized to dialectical frameworks, in case of stable and preferred semantics to a slightly restricted class which we call bipolar frameworks. We show how acceptance conditions can be conveniently represented using weights respectively priorities on the links and demonstrate how some of the legal proof standards can be modeled based on this idea. We finally show how Carneades, an advanced approach to argumentation proposed by Gordon, Prakken and Walton, can be reconstructed using ADFs. This way the rather severe restriction of Carneades to acyclic argument evaluation structures can be relaxed. |
|---|
| responsibles | Chevaleyre |
|---|
| |
|