Pré-Publication, Document De Travail Année : 2026

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.

Fichier principal
Vignette du fichier
Timed_Argumentation_Frameworks-with-proofs.pdf (264.78 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
licence

Dates et versions

hal-05609909 , version 1 (11-05-2026)

Licence

Identifiants

  • HAL Id : hal-05609909 , version 1

Citer

Jean-Guy Mailly, Frédéric Maris, Johannes Peter Wallner. Computational Complexity in Timed Argumentation Frameworks. 2026. ⟨hal-05609909⟩
0 Consultations
0 Téléchargements

Partager

  • More