KR2026Proceedings of the 23rd International Conference on Principles of Knowledge Representation and ReasoningProceedings of the 23rd International Conference on Principles of Knowledge Representation and Reasoning

Lisbon, Portugal. July 20-23, 2026.

Edited by
  1. Renata Wassermann
  2. Marie-Laure Mugnier
  3. Franz Baader

ISSN: 2334-1033
ISBN: 978-1-956792-18-8

Sponsored by
Published by

Copyright © 2026 International Joint Conferences on Artificial Intelligence Organization

Computational Complexity in Timed Argumentation Frameworks

  1. Jean-Guy Mailly(IRIT, Université Toulouse Capitole)
  2. Frédéric Maris(IRIT, Université de Toulouse)
  3. Johannes P. Wallner(Graz University of Technology)
PDF
BibTeX
https://doi.org/10.24963/kr.2026/47

Keywords

  1. null-abstract argumentation
  2. null-timed argumentation
  3. null-computational complexity

Abstract

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.