How complex is the strong admissibility semantics for abstract dialectical frameworks?

Atefeh Keshavarzi Zafarghandi*, Wolfgang Dvorak, Rineke Verbrugge, Bart Verheij

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

9 Downloads (Pure)


Abstract dialectical frameworks (ADFs) have been introduced as a formalism for modeling and evaluating argumentation allowing general logical satisfaction conditions. Different criteria used to settle the acceptance of arguments are called semantics. Semantics of ADFs have so far mainly been defined based on the concept of admissibility. Recently, the notion of strong admissibility has been introduced for ADFs. In the current work we study the computational complexity of the following reasoning tasks under strong admissibility semantics. We address 1.The credulous/skeptical decision problem; 2.The verification problem; 3.The strong justification problem; and 4.The problem of finding a smallest witness of strong justification of a queried argument.

Original languageEnglish
Title of host publicationComputational Models of Argument - Proceedings of COMMA 2022
EditorsFrancesca Toni, Sylwia Polberg, Richard Booth, Martin Caminada, Hiroyuki Kido
PublisherIOS Press
Number of pages12
ISBN (Electronic)9781643683065
Publication statusPublished - 7-Sep-2022
Event9th International Conference on Computational Models of Argument, COMMA 2022 - Wales, United Kingdom
Duration: 14-Sep-202216-Sep-2022

Publication series

NameFrontiers in Artificial Intelligence and Applications
ISSN (Print)0922-6389


Conference9th International Conference on Computational Models of Argument, COMMA 2022
Country/TerritoryUnited Kingdom


  • abstract dialectical frameworks
  • argumentation
  • complexity

Cite this