Computational Complexity of Strong Admissibility for Abstract Dialectical Frameworks

Atefeh Keshavarzi Zafarghandi, Wolfgang Dvorak, Rineke Verbrugge, Bart Verheij

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

185 Downloads (Pure)

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.
Original languageEnglish
Title of host publication19th International Workshop on Non-Monotonic Reasoning
Subtitle of host publicationNMR
EditorsLeila Amgoud , Richard Booth
Pages295-304
Number of pages9
Publication statusPublished - 2021
Event19th International Workshop on
Non-Monotonic Reasoning: NMR 2021
- Hanoi, Viet Nam
Duration: 3-Nov-20215-Nov-2021

Conference

Conference19th International Workshop on
Non-Monotonic Reasoning
Country/TerritoryViet Nam
CityHanoi
Period03/11/202105/11/2021

Fingerprint

Dive into the research topics of 'Computational Complexity of Strong Admissibility for Abstract Dialectical Frameworks'. Together they form a unique fingerprint.

Cite this