Strong admissibility for abstract dialectical frameworks

Abstract dialectical frameworks (ADFs) have been introduced as a formalism for modeling argumentation allowing general logical satisfaction conditions and the relevant argument evaluation. Different criteria used to settle acceptance of arguments are called semantics. Semantics ADFs so far mainly defined based on concept admissibility. However, notion strongly admissible semantics studied abstract has not yet ADFs. In current work we present strong admissibility interpretations Further, show that form lattice with grounded interpretation maximal element. We also algorithms answer following decision problems: (1) whether given is ADF, (2) acceptable/deniable in ADF. addition, forms proper generalization AFs.