Strong Admissibility for Abstract Dialectical Frameworks

Atefeh Keshavarzi Zafarghandi, Rineke Verbrugge, Bart Verheij

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 the acceptance of arguments are called semantics. Semantics of ADFs have so far mainly been defined based on the concept of admissibility. However, the notion of strongly admissible semantics studied for abstract argumentation frameworks has not yet been introduced for ADFs. In the current work we present the concept of strong admissibility of interpretations for ADFs. Further, we show that strongly admissible interpretations of ADFs form a lattice with the grounded interpretation as the maximal element. We also present algorithms to answer the following decision problems: (1) whether a given interpretation is a strongly admissible interpretation of a given ADF, and (2) whether a given argument is strongly acceptable/deniable in a given interpretation of a given ADF. In addition, we show that the strongly admissible semantics of ADFs forms a proper generalization of the strongly admissible semantics of AFs.

Manuscript (in PDF-format)
Published version

Reference:
Keshavarzi Zafarghandi, A., Verbrugge, R., & Verheij, B. (2022 to appear, 2021 online). Strong Admissibility for Abstract Dialectical Frameworks. Argument & Computation, 1-41. New York (New York): ACM. https://doi.org/10.3233/AAC-210002


Bart Verheij's home page - research - publications