Dvorak, Wolfgang

Keshavarzi Zafarghandi, Atefeh

Verbrugge, Rineke

Verheij, Bart

English

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 arecalled 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 complexityof 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

ARTS repository - University of Groningen

Computational Complexity of Strong Admissibility for Abstract Dialectical Frameworks

https://pure.rug.nl/ws/files/209086961/NMR2021Proceedings_1_.pdf

Computational Complexity of Strong Admissibility for Abstract Dialectical Frameworks

Abstract

Similar works

Full text

Available Versions

ARTS repository - University of Groningen