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