<div class="csl-bib-body">
<div class="csl-entry">Dvořák, W., Rienstra, T., van der Torre, L., & Woltran, S. (2022). Non-Admissibility in Abstract Argumentation. In F. Toni, S. Polberg, M. Caminada, R. Booth, & H. Kido (Eds.), <i>Computational Models of Argument - Proceedings of COMMA 2022</i> (pp. 128–139). IOS Press. https://doi.org/10.3233/FAIA220147</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/150296
-
dc.description.abstract
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.
en
dc.language.iso
en
-
dc.relation.ispartofseries
Frontiers in Artificial Intelligence and Applications
-
dc.subject
abstract argumentation
en
dc.subject
complexity
en
dc.subject
semantics
en
dc.subject
weak admissibility
en
dc.title
Non-Admissibility in Abstract Argumentation
en
dc.type
Inproceedings
en
dc.type
Konferenzbeitrag
de
dc.contributor.affiliation
Maastricht University
-
dc.contributor.affiliation
University of Luxembourg, Luxembourg
-
dc.contributor.editoraffiliation
TU Wien, Österreich
-
dc.contributor.editoraffiliation
Cardiff University
-
dc.contributor.editoraffiliation
Cardiff University
-
dc.contributor.editoraffiliation
Cardiff University
-
dc.relation.isbn
978-1-64368-307-2
-
dc.relation.doi
10.3233/FAIA353
-
dc.description.startpage
128
-
dc.description.endpage
139
-
dc.type.category
Full-Paper Contribution
-
tuw.booktitle
Computational Models of Argument - Proceedings of COMMA 2022
-
tuw.container.volume
353
-
tuw.peerreviewed
true
-
tuw.book.ispartofseries
Frontiers in Artificial Intelligence and Applications
