Reference : Non-Admissibility in abstract argumentation

	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a journal
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/54189

Title :	Non-Admissibility in abstract argumentation
Language :	English
Author, co-author :	Dvorak, Wolfgang [TU Wien, Austria]
	Rienstra, Tjitze [Universiteit Maastricht]
	van der Torre, Leon [University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS) > ; Zhejiang University]
	Woltran, Stefan [TU Wien, Austria]
Publication date :	2022
Journal title :	Frontiers in Artificial Intelligence and Applications
Publisher :	IOS Press BV
Volume :	353
Pages :	128-139
Peer reviewed :	Yes
Audience :	International
ISSN :	0922-6389
Event name :	9th International Conference on Computational Models of Argument, COMMA 2022
Event date :	14 September 2022 through 16 September 2022
Keywords :	[en] Computational methods ; Intelligent systems ; Abstract argumentation ; Argumentation frameworks ; Blockings ; Complexity ; Complexity based ; Formal argumentation ; Loop semantic ; Lower complexity ; Weak admissibility ; Semantics
Abstract :	[en] In this paper, we give an overview of several recent proposals for non-Admissible non-naive semantics for abstract argumentation frameworks. We highlight the similarities and differences between weak admissibility-based approaches and undecidedness-blocking approaches using examples and principles as well as a study of their computational complexity. We introduce a kind of strengthened undecidedness-blocking semantics combining some of the distinctive behaviours of weak admissibility-based semantics with the lower complexity of undecidedness-blocking approaches. We call it loop semantics, because in our new semantics, an argument can only be undecided if it is part of a loop of undecided arguments. Our paper shows how a principle-based approach and a complexity-based approach can be used in tandem to further develop the foundations of formal argumentation.
Funders :	Vienna Science and Technology Fund, WWTF: ICT19-065; Fonds National de la Recherche Luxembourg, FNR: INTER/Mobility/19/13995684/DLAl/van; Austrian Science Fund, FWF: Y698 ; European Association of AI (EurAI);School of Computer Science and Informatics at the Cardiff University
Permalink :	http://hdl.handle.net/10993/54189
DOI :	10.3233/FAIA220147
Mentions required by the publisher for OA :	© 2022 The authors and IOS Press. This article is published online with Open Access by IOS Press and distributed under the terms of the Creative Commons Attribution Non-Commercial License 4.0 (CC BY-NC 4.0).
FnR project :	FnR ; FNR13995684 > Leon Van Der Torre > DLAI > Deontic Logic For Artificial Intelligence > 01/09/2020 > 31/08/2022 > 2019

	File(s) associated to this reference
	Fulltext file(s): File Commentary Version Size Access Limited access Non-Admissibility in Abstract Argumentation.pdf Publisher postprint 307.02 kB Request a copy

All documents in ORBi^lu are protected by a user license.

 

University of Luxembourg Library |  Feedback |  Legal notices Site Map