[Back]

A. Keshavarzi Zafarghandi, W. Dvorak, R. Verbrugge, B. Verheij:
"Computational Complexity of Strong Admissibility for Abstract Dialectical Frameworks";
Talk: NMR 2021 - 19th International Workshop on Non-Monotonic Reasoning, Hanoi, Vietnam; 2021-11-03 - 2021-11-05.

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.