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 |
Keywords
- Abstract Argumentation
- Equivalence
- Ranking-based Semantics
- Realisability