New Weak Admissibility Semantics for Abstract Argumentation

Jeremie Dauphin; Tjitze Rienstra; Leendert van der Torre

doi:10.1007/978-3-030-89391-0_7

New Weak Admissibility Semantics for Abstract Argumentation

Jeremie Dauphin^*, Tjitze Rienstra, Leendert van der Torre

^*Corresponding author for this work

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

Abstract

Baumann, Brewka and Ulbricht [3, 4] recently introduced weak admissibility as an alternative to Dung's notion of admissibility [7], and they used it to define weakly preferred, weakly complete and weakly grounded semantics of argumentation frameworks. In earlier work, we introduced two variants of their new semantics which we called qualified and semi-qualified semantics. We analysed all known variants of weak admissibility semantics with respect to some of the principles discussed in the literature on abstract argumentation, as well as some new principles we introduced to distinguish them all. Such a principle-based analysis can be used not only for selecting a semantics for an application, or for algorithmic design, but also for further research into weak admissibility semantics. In this paper, we introduce six new kinds of semantics based on weak admissibility, and we provide an initial principle-based analysis. The analysis illustrates various ways in which the new semantics improve on existing ones

Original language	English
Title of host publication	Logic and Argumentation
Subtitle of host publication	4th International Conference on Logic and Argumentation, CLAR 2021
Editors	Pietro Baroni, Christoph Benzmüller, Yi N. Wang
Publisher	Springer International Publishing
Pages	112-126
Number of pages	15
ISBN (Print)	978-3-030-89390-3
DOIs	https://doi.org/10.1007/978-3-030-89391-0_7
Publication status	Published - 15 Oct 2021
Event	4th International Conference on Logic and Argumentation (CLAR) - Zhejiang University City College (Virtual), Hangzhou, China Duration: 20 Oct 2021 → 22 Oct 2021 Conference number: 4 https://link.springer.com/conference/clar

Publication series

Series	Lecture Notes in Computer Science
Volume	13040
ISSN	0302-9743

Conference

Conference	4th International Conference on Logic and Argumentation (CLAR)
Abbreviated title	CLAR 2021
Country/Territory	China
City	Hangzhou
Period	20/10/21 → 22/10/21
Internet address	https://link.springer.com/conference/clar

Keywords

Formal argumentation
Abstract argumentation
Principle-based analysis
Weak admissibility

Access to Document

10.1007/978-3-030-89391-0_7

Cite this

Dauphin, Jeremie ; Rienstra, Tjitze ; van der Torre, Leendert. / New Weak Admissibility Semantics for Abstract Argumentation. Logic and Argumentation: 4th International Conference on Logic and Argumentation, CLAR 2021. editor / Pietro Baroni ; Christoph Benzmüller ; Yi N. Wang. Springer International Publishing, 2021. pp. 112-126 (Lecture Notes in Computer Science, Vol. 13040).

@inbook{ddcd88eb7e4742c5a686085f88cb66ba,

title = "New Weak Admissibility Semantics for Abstract Argumentation",

abstract = "Baumann, Brewka and Ulbricht [3, 4] recently introduced weak admissibility as an alternative to Dung's notion of admissibility [7], and they used it to define weakly preferred, weakly complete and weakly grounded semantics of argumentation frameworks. In earlier work, we introduced two variants of their new semantics which we called qualified and semi-qualified semantics. We analysed all known variants of weak admissibility semantics with respect to some of the principles discussed in the literature on abstract argumentation, as well as some new principles we introduced to distinguish them all. Such a principle-based analysis can be used not only for selecting a semantics for an application, or for algorithmic design, but also for further research into weak admissibility semantics. In this paper, we introduce six new kinds of semantics based on weak admissibility, and we provide an initial principle-based analysis. The analysis illustrates various ways in which the new semantics improve on existing ones",

keywords = "Formal argumentation, Abstract argumentation, Principle-based analysis, Weak admissibility",

author = "Jeremie Dauphin and Tjitze Rienstra and {van der Torre}, Leendert",

note = "Funding Information: Acknowledgements. Leon van der Torre acknowledges financial support from the Fonds National de la Recherche Luxembourg (INTER/Mobility/19/13995684/ DLAl/van der Torre). Publisher Copyright: {\textcopyright} 2021, Springer Nature Switzerland AG.; 4th International Conference on Logic and Argumentation (CLAR), CLAR 2021 ; Conference date: 20-10-2021 Through 22-10-2021",

year = "2021",

month = oct,

day = "15",

doi = "10.1007/978-3-030-89391-0_7",

language = "English",

isbn = "978-3-030-89390-3",

series = "Lecture Notes in Computer Science",

publisher = "Springer International Publishing",

pages = "112--126",

editor = "Pietro Baroni and Christoph Benzm{\"u}ller and Wang, {Yi N.}",

booktitle = "Logic and Argumentation",

address = "Switzerland",

url = "https://link.springer.com/conference/clar",

}

Dauphin, J, Rienstra, T & van der Torre, L 2021, New Weak Admissibility Semantics for Abstract Argumentation. in P Baroni, C Benzmüller & YN Wang (eds), Logic and Argumentation: 4th International Conference on Logic and Argumentation, CLAR 2021. Springer International Publishing, Lecture Notes in Computer Science, vol. 13040, pp. 112-126, 4th International Conference on Logic and Argumentation (CLAR), Hangzhou, China, 20/10/21. https://doi.org/10.1007/978-3-030-89391-0_7

New Weak Admissibility Semantics for Abstract Argumentation. / Dauphin, Jeremie; Rienstra, Tjitze; van der Torre, Leendert.
Logic and Argumentation: 4th International Conference on Logic and Argumentation, CLAR 2021. ed. / Pietro Baroni; Christoph Benzmüller; Yi N. Wang. Springer International Publishing, 2021. p. 112-126 (Lecture Notes in Computer Science, Vol. 13040).

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

TY - CHAP

T1 - New Weak Admissibility Semantics for Abstract Argumentation

AU - Dauphin, Jeremie

AU - Rienstra, Tjitze

AU - van der Torre, Leendert

N1 - Conference code: 4

PY - 2021/10/15

Y1 - 2021/10/15

N2 - Baumann, Brewka and Ulbricht [3, 4] recently introduced weak admissibility as an alternative to Dung's notion of admissibility [7], and they used it to define weakly preferred, weakly complete and weakly grounded semantics of argumentation frameworks. In earlier work, we introduced two variants of their new semantics which we called qualified and semi-qualified semantics. We analysed all known variants of weak admissibility semantics with respect to some of the principles discussed in the literature on abstract argumentation, as well as some new principles we introduced to distinguish them all. Such a principle-based analysis can be used not only for selecting a semantics for an application, or for algorithmic design, but also for further research into weak admissibility semantics. In this paper, we introduce six new kinds of semantics based on weak admissibility, and we provide an initial principle-based analysis. The analysis illustrates various ways in which the new semantics improve on existing ones

AB - Baumann, Brewka and Ulbricht [3, 4] recently introduced weak admissibility as an alternative to Dung's notion of admissibility [7], and they used it to define weakly preferred, weakly complete and weakly grounded semantics of argumentation frameworks. In earlier work, we introduced two variants of their new semantics which we called qualified and semi-qualified semantics. We analysed all known variants of weak admissibility semantics with respect to some of the principles discussed in the literature on abstract argumentation, as well as some new principles we introduced to distinguish them all. Such a principle-based analysis can be used not only for selecting a semantics for an application, or for algorithmic design, but also for further research into weak admissibility semantics. In this paper, we introduce six new kinds of semantics based on weak admissibility, and we provide an initial principle-based analysis. The analysis illustrates various ways in which the new semantics improve on existing ones

KW - Formal argumentation

KW - Abstract argumentation

KW - Principle-based analysis

KW - Weak admissibility

U2 - 10.1007/978-3-030-89391-0_7

DO - 10.1007/978-3-030-89391-0_7

M3 - Chapter

SN - 978-3-030-89390-3

T3 - Lecture Notes in Computer Science

SP - 112

EP - 126

BT - Logic and Argumentation

A2 - Baroni, Pietro

A2 - Benzmüller, Christoph

A2 - Wang, Yi N.

PB - Springer International Publishing

T2 - 4th International Conference on Logic and Argumentation (CLAR)

Y2 - 20 October 2021 through 22 October 2021

ER -

Dauphin J, Rienstra T, van der Torre L. New Weak Admissibility Semantics for Abstract Argumentation. In Baroni P, Benzmüller C, Wang YN, editors, Logic and Argumentation: 4th International Conference on Logic and Argumentation, CLAR 2021. Springer International Publishing. 2021. p. 112-126. (Lecture Notes in Computer Science, Vol. 13040). doi: 10.1007/978-3-030-89391-0_7

New Weak Admissibility Semantics for Abstract Argumentation

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this