Ulbricht, Markus, Potyka, Nico, Rapberger, Anna and Toni, Francesca 2024. Non-flat ABA is an instance of bipolar argumentation. Presented at: The Thirty-Eighth AAAI Conference on Artificial Intelligence (AAAI-24), 20-27 February 2024. Proceedings of the AAAI Conference on Artificial Intelligence: AAAI Technical Track on Knowledge Representation and Reasoning. , vol.38 (9) pp. 10723-10731. 10.1609/aaai.v38i9.28944 |
Preview |
PDF
- Published Version
Download (186kB) | Preview |
Abstract
Assumption-based Argumentation (ABA) is a well-known structured argumentation formalism, whereby arguments and attacks between them are drawn from rules, defeasible assumptions and their contraries. A common restriction imposed on ABA frameworks (ABAFs) is that they are flat, i.e. each of the defeasible assumptions can only be assumed, but not derived. While it is known that flat ABAFs can be translated into abstract argumentation frameworks (AFs) as proposed by Dung, no translation exists from general, possibly non-flat ABAFs into any kind of abstract argumentation formalism. In this paper, we close this gap and show that bipolar AFs (BAFs) can instantiate general ABAFs. To this end we develop suitable, novel BAF semantics which borrow from the notion of deductive support. We investigate basic properties of our BAFs, including computational complexity, and prove the desired relation to ABAFs under several semantics.
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Date Type: | Publication |
Status: | Published |
Schools: | Computer Science & Informatics |
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Date of First Compliant Deposit: | 15 May 2024 |
Date of Acceptance: | 9 December 2023 |
Last Modified: | 17 Jun 2024 01:30 |
URI: | https://orca.cardiff.ac.uk/id/eprint/168928 |
Actions (repository staff only)
Edit Item |