Abstract
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.
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 language | English |
---|---|
Title of host publication | 19th International Workshop on Non-Monotonic Reasoning |
Subtitle of host publication | NMR |
Editors | Leila Amgoud , Richard Booth |
Pages | 295-304 |
Number of pages | 9 |
Publication status | Published - 2021 |
Event | 19th International Workshop on Non-Monotonic Reasoning: NMR 2021 - Hanoi, Viet Nam Duration: 3-Nov-2021 → 5-Nov-2021 |
Conference
Conference | 19th International Workshop on Non-Monotonic Reasoning |
---|---|
Country/Territory | Viet Nam |
City | Hanoi |
Period | 03/11/2021 → 05/11/2021 |