Realisability of Ranking-based Semantics

Kenneth Skiba; Matthias Thimm; Tjitze Rienstra; J.L.A. Heyninck; Gabriele Kern-Isberner

Realisability of Ranking-based Semantics

Kenneth Skiba^*
, Matthias Thimm
, Tjitze Rienstra
, J.L.A. Heyninck
, Gabriele Kern-Isberner

^*Corresponding author for this work

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

Abstract

In this work, we discuss the realisability problem for ranking-based semantics in the area of abstract argumentation. So, for a given ranking and ranking-based semantics, we want to find an AF s.t. the selected ranking-based semantics induces our ranking when applied to the AF. We show that this question can be answered trivially with yes for a number of ranking-based semantics, i.e. for every ranking we can find such an AF. In addition to the discussion about the realisability problem, we also introduce a new equivalence notion for argumentation frameworks. We call two AFs ranking equivalent if they have the same ranking for a ranking-based semantics.

Original language	English
Title of host publication	SAFA’22: Fourth International Workshop on Systems and Algorithms for Formal Argumentation 2022
Editors	Sarah A. Gaggl , Jean-Guy Mailly , Matthias Thimm , Johannes P. Wallner
Publisher	CEUR-WS.org
Pages	73-85
Number of pages	13
Volume	3236
Publication status	Published - Oct 2022
Event	Fourth International Workshop on Systems and Algorithms for Formal Argumentation 2022 - Cardiff, Wales, United Kingdom Duration: 13 Sept 2022 → 13 Sept 2022 Conference number: 4 https://safa2022.argumentationcompetition.org/

Conference

Conference	Fourth International Workshop on Systems and Algorithms for Formal Argumentation 2022
Abbreviated title	SAFA’22
Country/Territory	United Kingdom
City	Cardiff, Wales
Period	13/09/22 → 13/09/22
Internet address	https://safa2022.argumentationcompetition.org/

Keywords

Abstract Argumentation
Equivalence
Ranking-based Semantics
Realisability

Access to Document

https://ceur-ws.org/Vol-3236/paper6.pdfLicence: CC BY

Cite this

@inproceedings{357e0334eb45419eb2e69a3d93e6f400,

title = "Realisability of Ranking-based Semantics",

abstract = "In this work, we discuss the realisability problem for ranking-based semantics in the area of abstract argumentation. So, for a given ranking and ranking-based semantics, we want to find an AF s.t. the selected ranking-based semantics induces our ranking when applied to the AF. We show that this question can be answered trivially with yes for a number of ranking-based semantics, i.e. for every ranking we can find such an AF. In addition to the discussion about the realisability problem, we also introduce a new equivalence notion for argumentation frameworks. We call two AFs ranking equivalent if they have the same ranking for a ranking-based semantics.",

keywords = "Abstract Argumentation, Equivalence, Ranking-based Semantics, Realisability",

author = "Kenneth Skiba and Matthias Thimm and Tjitze Rienstra and J.L.A. Heyninck and Gabriele Kern-Isberner",

year = "2022",

month = oct,

language = "English",

volume = "3236",

pages = "73--85",

editor = "\{Sarah A. Gaggl\} and \{Jean-Guy Mailly\} and \{Matthias Thimm\} and \{Johannes P. Wallner\}",

booktitle = "SAFA{\textquoteright}22: Fourth International Workshop on Systems and Algorithms for Formal Argumentation 2022",

publisher = "CEUR-WS.org",

address = "Germany",

note = "Fourth International Workshop on Systems and Algorithms for Formal Argumentation 2022, SAFA{\textquoteright}22 ; Conference date: 13-09-2022 Through 13-09-2022",

url = "https://safa2022.argumentationcompetition.org/",

}

Skiba, K, Thimm, M, Rienstra, T, Heyninck, JLA & Kern-Isberner, G 2022, Realisability of Ranking-based Semantics. in SAG, J-GM, MT & Johannes P. Wallner (eds), SAFA’22: Fourth International Workshop on Systems and Algorithms for Formal Argumentation 2022. vol. 3236, CEUR-WS.org, pp. 73-85, Fourth International Workshop on Systems and Algorithms for Formal Argumentation 2022, Cardiff, Wales, United Kingdom, 13/09/22. <https://ceur-ws.org/Vol-3236/paper6.pdf>

Realisability of Ranking-based Semantics. / Skiba, Kenneth; Thimm, Matthias; Rienstra, Tjitze et al.
SAFA’22: Fourth International Workshop on Systems and Algorithms for Formal Argumentation 2022. ed. / Sarah A. Gaggl; Jean-Guy Mailly; Matthias Thimm; Johannes P. Wallner. Vol. 3236 CEUR-WS.org, 2022. p. 73-85.

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

TY - GEN

T1 - Realisability of Ranking-based Semantics

AU - Skiba, Kenneth

AU - Thimm, Matthias

AU - Rienstra, Tjitze

AU - Heyninck, J.L.A.

AU - Kern-Isberner, Gabriele

N1 - Conference code: 4

PY - 2022/10

Y1 - 2022/10

N2 - In this work, we discuss the realisability problem for ranking-based semantics in the area of abstract argumentation. So, for a given ranking and ranking-based semantics, we want to find an AF s.t. the selected ranking-based semantics induces our ranking when applied to the AF. We show that this question can be answered trivially with yes for a number of ranking-based semantics, i.e. for every ranking we can find such an AF. In addition to the discussion about the realisability problem, we also introduce a new equivalence notion for argumentation frameworks. We call two AFs ranking equivalent if they have the same ranking for a ranking-based semantics.

AB - In this work, we discuss the realisability problem for ranking-based semantics in the area of abstract argumentation. So, for a given ranking and ranking-based semantics, we want to find an AF s.t. the selected ranking-based semantics induces our ranking when applied to the AF. We show that this question can be answered trivially with yes for a number of ranking-based semantics, i.e. for every ranking we can find such an AF. In addition to the discussion about the realisability problem, we also introduce a new equivalence notion for argumentation frameworks. We call two AFs ranking equivalent if they have the same ranking for a ranking-based semantics.

KW - Abstract Argumentation

KW - Equivalence

KW - Ranking-based Semantics

KW - Realisability

UR - https://ceur-ws.org/Vol-3236/

M3 - Conference Article in proceeding

VL - 3236

SP - 73

EP - 85

BT - SAFA’22: Fourth International Workshop on Systems and Algorithms for Formal Argumentation 2022

A2 - , Sarah A. Gaggl

A2 - , Jean-Guy Mailly

A2 - , Matthias Thimm

A2 - Johannes P. Wallner,

PB - CEUR-WS.org

T2 - Fourth International Workshop on Systems and Algorithms for Formal Argumentation 2022

Y2 - 13 September 2022 through 13 September 2022

ER -

Realisability of Ranking-based Semantics

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this