Non-Admissibility in Abstract Argumentation

Wolfgang Dvorák; Tjitze Rienstra; Leendert van der Torre; Stefan Woltran

doi:10.3233/faia220147

Non-Admissibility in Abstract Argumentation

Wolfgang Dvorák^*, Tjitze Rienstra, Leendert van der Torre, Stefan Woltran

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic

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.

Original language	English
Title of host publication	Computational Models of Argument
Editors	Fransesca Toni, Sylwia Polberg, Richard Booth, Martin Caminada, Hiroyuki Kido
Pages	128-139
DOIs	https://doi.org/10.3233/faia220147
Publication status	Published - 2022
Event	Computational Models of Argument - Cardiff University, Cardiff, United Kingdom Duration: 14 Sept 2022 → 16 Sept 2022 https://comma.csc.liv.ac.uk/node/31#:~:text=COMMA%202022%20will%20be%20held,University%20in%20Wales%2C%20United%20Kingdom.&text=In%20addition%20to%20the%20main,on%20current%20topics%20of%20argumentation.

Publication series

Series	Frontiers in Artificial Intelligence and Applications
Volume	353
ISSN	0922-6389

Conference

Conference	Computational Models of Argument
Abbreviated title	COMMA 2022
Country/Territory	United Kingdom
City	Cardiff
Period	14/09/22 → 16/09/22
Internet address	https://comma.csc.liv.ac.uk/node/31#:~:text=COMMA%202022%20will%20be%20held,University%20in%20Wales%2C%20United%20Kingdom.&text=In%20addition%20to%20the%20main,on%20current%20topics%20of%20argumentation.

Access to Document

10.3233/faia220147Licence: CC BY-NC

Cite this

@inbook{1bc2c021c8364de693aaa716e7c922bd,

title = "Non-Admissibility in Abstract Argumentation",

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

author = "Wolfgang Dvor{\'a}k and Tjitze Rienstra and Torre, {Leendert van der} and Stefan Woltran",

note = "DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.; Computational Models of Argument, COMMA 2022 ; Conference date: 14-09-2022 Through 16-09-2022",

year = "2022",

doi = "10.3233/faia220147",

language = "English",

isbn = "978-1-64368-306-5",

series = "Frontiers in Artificial Intelligence and Applications",

publisher = "IOS Press",

pages = "128--139",

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

booktitle = "Computational Models of Argument",

url = "https://comma.csc.liv.ac.uk/node/31#:~:text=COMMA%202022%20will%20be%20held,University%20in%20Wales%2C%20United%20Kingdom.&text=In%20addition%20to%20the%20main,on%20current%20topics%20of%20argumentation.",

}

Dvorák, W, Rienstra, T, Torre, LVD & Woltran, S 2022, Non-Admissibility in Abstract Argumentation. in F Toni, S Polberg, R Booth, M Caminada & H Kido (eds), Computational Models of Argument. Frontiers in Artificial Intelligence and Applications, vol. 353, pp. 128-139, Computational Models of Argument, Cardiff, United Kingdom, 14/09/22. https://doi.org/10.3233/faia220147

Non-Admissibility in Abstract Argumentation. / Dvorák, Wolfgang; Rienstra, Tjitze; Torre, Leendert van der et al.
Computational Models of Argument. ed. / Fransesca Toni; Sylwia Polberg; Richard Booth; Martin Caminada; Hiroyuki Kido. 2022. p. 128-139 (Frontiers in Artificial Intelligence and Applications, Vol. 353).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic

TY - CHAP

T1 - Non-Admissibility in Abstract Argumentation

AU - Dvorák, Wolfgang

AU - Rienstra, Tjitze

AU - Torre, Leendert van der

AU - Woltran, Stefan

N1 - DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2022

Y1 - 2022

N2 - 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.

AB - 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.

U2 - 10.3233/faia220147

DO - 10.3233/faia220147

M3 - Chapter

SN - 978-1-64368-306-5

T3 - Frontiers in Artificial Intelligence and Applications

SP - 128

EP - 139

BT - Computational Models of Argument

A2 - Toni, Fransesca

A2 - Polberg, Sylwia

A2 - Booth, Richard

A2 - Caminada, Martin

A2 - Kido, Hiroyuki

T2 - Computational Models of Argument

Y2 - 14 September 2022 through 16 September 2022

ER -

Non-Admissibility in Abstract Argumentation

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this