Computational Complexity in Timed Argumentation Frameworks
Résumé
Timed Argumentation Frameworks (TAFs) allow taking into account the availability of arguments and attacks in abstract argumentation. We propose a new reasoning approach for TAFs, where a standard Dung-style AF can be associated with each timepoint. We show that, although this framework is more expressive than Dung's framework, our approach does not lead to an increase in computational complexity for most reasoning problems and classical extension-based semantics.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|---|
| licence |
