How complex is the strong admissibility semantics for abstract dialectical frameworks?

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

doi:10.3233/FAIA220153

How complex is the strong admissibility semantics for abstract dialectical frameworks?

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

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

9 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 language	English
Title of host publication	Computational Models of Argument - Proceedings of COMMA 2022
Editors	Francesca Toni, Sylwia Polberg, Richard Booth, Martin Caminada, Hiroyuki Kido
Publisher	IOS Press
Pages	200-211
Number of pages	12
ISBN (Electronic)	9781643683065
DOIs	https://doi.org/10.3233/FAIA220153
Publication status	Published - 7-Sep-2022
Event	9th International Conference on Computational Models of Argument, COMMA 2022 - Wales, United Kingdom Duration: 14-Sep-2022 → 16-Sep-2022

Publication series

Name	Frontiers in Artificial Intelligence and Applications
Volume	353
ISSN (Print)	0922-6389

Conference

Conference	9th International Conference on Computational Models of Argument, COMMA 2022
Country/Territory	United Kingdom
City	Wales
Period	14/09/2022 → 16/09/2022

Keywords

abstract dialectical frameworks
argumentation
complexity

Access to Document

10.3233/FAIA220153Licence: CC BY-NC

How Complex Is the Strong Admissibility Semantics for Abstract Dialectical Frameworks?Final publisher's version, 304 KBLicence: CC BY-NC

Handle.net

Persistent link

Cite this

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, M. Caminada, & H. Kido (Eds.), Computational Models of Argument - Proceedings of COMMA 2022 (pp. 200-211). (Frontiers in Artificial Intelligence and Applications; Vol. 353). IOS Press. https://doi.org/10.3233/FAIA220153

Keshavarzi Zafarghandi, Atefeh ; Dvorak, Wolfgang ; Verbrugge, Rineke et al. / How complex is the strong admissibility semantics for abstract dialectical frameworks?. Computational Models of Argument - Proceedings of COMMA 2022. editor / Francesca Toni ; Sylwia Polberg ; Richard Booth ; Martin Caminada ; Hiroyuki Kido. IOS Press, 2022. pp. 200-211 (Frontiers in Artificial Intelligence and Applications).

@inproceedings{bebd6350e5074245a590cd2f8d64e37b,

title = "How complex is the strong admissibility semantics for abstract dialectical frameworks?",

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. ",

keywords = "abstract dialectical frameworks, argumentation, complexity",

author = "{Keshavarzi Zafarghandi}, Atefeh and Wolfgang Dvorak and Rineke Verbrugge and Bart Verheij",

note = "Funding Information: Acknowledgments This research has been supported by the Center of Data Science & Systems Complexity (DSSC) Doctoral Programme, at the University of Groningen. The first researcher is currently embedded in Centrum Wiskunde & Informatica (CWI) and Supported by the Netherlands eScience Center project “The Eye of the Beholder” (project nr. 027.020.G15). Publisher Copyright: {\textcopyright} 2022 The authors and IOS Press. All rights reserved.; 9th International Conference on Computational Models of Argument, COMMA 2022 ; Conference date: 14-09-2022 Through 16-09-2022",

year = "2022",

month = sep,

day = "7",

doi = "10.3233/FAIA220153",

language = "English",

series = "Frontiers in Artificial Intelligence and Applications",

publisher = "IOS Press",

pages = "200--211",

editor = "Francesca Toni and Sylwia Polberg and Richard Booth and Martin Caminada and Hiroyuki Kido",

booktitle = "Computational Models of Argument - Proceedings of COMMA 2022",

}

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, M Caminada & H Kido (eds), Computational Models of Argument - Proceedings of COMMA 2022. Frontiers in Artificial Intelligence and Applications, vol. 353, IOS Press, pp. 200-211, 9th International Conference on Computational Models of Argument, COMMA 2022, Wales, United Kingdom, 14/09/2022. https://doi.org/10.3233/FAIA220153

How complex is the strong admissibility semantics for abstract dialectical frameworks? / Keshavarzi Zafarghandi, Atefeh; Dvorak, Wolfgang; Verbrugge, Rineke et al.

Computational Models of Argument - Proceedings of COMMA 2022. ed. / Francesca Toni; Sylwia Polberg; Richard Booth; Martin Caminada; Hiroyuki Kido. IOS Press, 2022. p. 200-211 (Frontiers in Artificial Intelligence and Applications; Vol. 353).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review