Record link: 
http://hdl.handle.net/20.500.12708/150289
-
Title: 
How complex is the strong admissibility semantics for abstract dialectical frameworks?
en
Citation: 
Keshavarzi Zafarghandi, A., Dvorak, W., Verbrugge, R., & Verheij, B. (2022). How complex is the strong admissibility semantics for abstract dialectical frameworks? In F. Toni, S. Polberg, R. Booth, Caminada Martin, & H. Kido (Eds.), Computational Models of Argument - Proceedings of COMMA 2022 (pp. 200–211). IOS Press. https://doi.org/10.3233/FAIA220153
-
Publisher DOI: 
10.3233/FAIA220153
-
Publication Type: 
Inproceedings - Full-Paper Contribution
en
Language: 
English
-
Authors: 
Keshavarzi Zafarghandi, Atefeh 
Dvorak, Wolfgang 
Verbrugge, Rineke 
Verheij, Bart 
-
Organisational Unit: 
E192-02 - Forschungsbereich Databases and Artificial Intelligence 
-
Published in: 
Computational Models of Argument - Proceedings of COMMA 2022 
-
ISBN: 
978-1-64368-307-2
-
Volume: 
353
-
DOI of the book: 
10.3233/FAIA353
-
Date (published): 
7-Sep-2022
-
Event name: 
9th International Conference on Computational Models of Argument (COMMA 2022) 
en
Event date: 
14-Sep-2022 - 16-Sep-2022
-
Event place: 
Cardiff, Wales, United Kingdom of Great Britain and Northern Ireland (the)
-
Number of Pages: 
12
-
Publisher: 
IOS Press
-
Peer reviewed: 
Yes
-
Keywords: 
abstract dialectical frameworks; argumentation; complexity
en
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.
en
Project (external): 
Netherlands eScience Center
-
Project ID: 
027.020.G15
-
Link (external): 
https://ebooks.iospress.nl/volume/computational-models-of-argument-proceedings-of-comma-2022
https://ebooks.iospress.nl/doi/10.3233/FAIA220153
-
Research Areas: 
Logic and Computation: 100%
-
Science Branch: 
1020 - Informatik: 100%
-
Appears in Collections:
Conference Paper

Show full item record

Page view(s)

123
checked on Nov 23, 2023

Download(s)

2
checked on Nov 23, 2023

Google ScholarTM

Check