Redefining ABA+ semantics via abstract set-to-set attacks
File(s)
Accepted version
Author(s)
Type
Conference Paper
Abstract
Assumption-based argumentation (ABA) is a powerful defeasible reasoning formalism which is based on the interplay of assumptions, their contraries, and inference rules. ABA with preferences (ABA+) generalizes the basic model by allowing a qualitative comparison of assumptions. The integration of preferences however comes with a cost. In ABA+, the evaluation under two central and well-established semantics—grounded and complete semantics—is not guaranteed to yield
an outcome. Moreover, while ABA frameworks without preferences allow for a graph-based representation in Dung-style frameworks, an according instantiation for general ABA+ frameworks has not been established so far. In this work, we tackle both issues: First, we develop a novel abstract argumentation formalism based on set-to-set attacks. We show that our so-called Hyper Argumentation Frameworks (HY-PAFs) capture ABA+. Second, we propose relaxed variants of complete and grounded semantics for HYPAFs that yield an
extension for all frameworks by design, while still faithfully generalizing the established semantics of Dung-style Argumentation Frameworks. We exploit the newly established correspondence between ABA+ and HYPAFs to obtain variants for grounded and complete ABA+ semantics that are guaranteed to yield an outcome. Finally, we discuss basic properties and provide a complexity analysis. Along the way, we settle the computational complexity of several ABA+ semantics.
an outcome. Moreover, while ABA frameworks without preferences allow for a graph-based representation in Dung-style frameworks, an according instantiation for general ABA+ frameworks has not been established so far. In this work, we tackle both issues: First, we develop a novel abstract argumentation formalism based on set-to-set attacks. We show that our so-called Hyper Argumentation Frameworks (HY-PAFs) capture ABA+. Second, we propose relaxed variants of complete and grounded semantics for HYPAFs that yield an
extension for all frameworks by design, while still faithfully generalizing the established semantics of Dung-style Argumentation Frameworks. We exploit the newly established correspondence between ABA+ and HYPAFs to obtain variants for grounded and complete ABA+ semantics that are guaranteed to yield an outcome. Finally, we discuss basic properties and provide a complexity analysis. Along the way, we settle the computational complexity of several ABA+ semantics.
Date Issued
2024-03-24
Date Acceptance
2023-12-09
Citation
Proceedings of the 38th Annual AAAI Conference on Artificial Intelligence, 2024, 38 (9), pp.10493-10500
ISBN
978-1-57735-887-9
ISSN
2374-3468
Publisher
AAAI
Start Page
10493
End Page
10500
Journal / Book Title
Proceedings of the 38th Annual AAAI Conference on Artificial Intelligence
Volume
38
Issue
9
Copyright Statement
Copyright © 2024, Association for the Advancement of Artificial Intelligence. Dimopoulos , Y., Dvorak, W., König, M., Rapberger, A., Ulbricht, M., & Woltran, S. (2024). Redefining ABA+ Semantics via Abstract Set-to-Set Attacks. Proceedings of the AAAI Conference on Artificial Intelligence, 38(9), 10493-10500. https://doi.org/10.1609/aaai.v38i9.28918
Identifier
https://ojs.aaai.org/index.php/AAAI/article/view/28918
Source
The 38th Annual AAAI Conference on Artificial Intelligence
Notes
AAAI Technical Track on Knowledge Representation and Reasoning
Publication Status
Published
Start Date
2024-02-20
Finish Date
2024-02-27
Coverage Spatial
Vancouver, Canada
Date Publish Online
2024-03-24