On the Complexity of Initial Models in Abstract Dialectical Frameworks

Hannes StraßHannes Straß, Johannes P. WallnerJohannes P. Wallner

Download

Hannes Straß, Johannes P. Wallner
On the Complexity of Initial Models in Abstract Dialectical Frameworks
In Katie Atkinson, eds., Proceedings of the Eleventh International Conference on Computational Models of Argument (COMMA), to appear. IOS Press

Details
Bibtex

KurzfassungAbstract
Abstract dialectical frameworks (ADFs) constitute one of the most general formal approaches within abstract argumentation. Recently, Bengel and Thimm (2025) proposed so-called initial models in ADFs as a suitable concept for “serializing” reasoning, i.e., decomposing reasoning in ADFs step by step. They showed several complexity results for reasoning with initial models. Our contributions in this paper are (i) that we close a gap in their complexity results of verifying initial models by showing DP-completeness, and (ii) based on our complexity results we provide an answer set programming (ASP) implementation to support systems utilizing initial models.
Projekt:Project: ScaDS.AI
Forschungsgruppe:Research Group: Computational LogicComputational Logic

@inproceedings{SW2026,
  author    = {Hannes Stra{\ss} and Johannes P. Wallner},
  title     = {On the Complexity of Initial Models in Abstract Dialectical
               Frameworks},
  editor    = {Katie Atkinson},
  booktitle = {Proceedings of the Eleventh International Conference on
               Computational Models of Argument (COMMA)},
  publisher = {IOS Press},
  year      = {2026}
}