Capturing Bipolar Argumentation in Non-flat Assumption-Based Argumentation
File(s)Bipolar ABA (PRIMA'17) - final.pdf (366.66 KB)
Accepted version
Author(s)
Cyras, K
Schulz, C
Toni, F
Type
Conference Paper
Abstract
Bipolar Argumentation Frameworks (BAFs) encompass both attacks and supports among arguments. We study different semantic interpretations of support in BAFs, particularly necessary and deductive support, as well as argument coalitions and a recent proposal by Gabbay. We analyse the relationship of these different notions of support in BAFs with the semantics of a well established structured argumentation formalism, Assumption-Based Argumentation (ABA), which predates BAFs. We propose natural mappings from BAFs into a restricted class of (non-flat) ABA frameworks, which we call bipolar, and prove that the admissible and preferred semantics of these ABA frameworks correspond to the admissible and preferred semantics of the various approaches to BAFs. Motivated by the definition of stable semantics for BAFs, we introduce a novel set-stable semantics for ABA frameworks, and prove that it corresponds to the stable semantics of the various approaches to BAFs. Finally, as a by-product of modelling various approaches to BAFs in bipolar ABA, we identify precise semantic relationships amongst all approaches we consider.
Date Issued
2017-10-05
Date Acceptance
2017-08-30
Citation
Lecture Notes in Computer Science, 2017, 10621, pp.386-402
ISBN
978-3-319-69130-5
ISSN
0302-9743
Publisher
Springer Verlag
Start Page
386
End Page
402
Journal / Book Title
Lecture Notes in Computer Science
Volume
10621
Copyright Statement
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-69131-2_23
Source
PRIMA 2017: Principles and Practice of Multi-Agent Systems - 20th International Conference
Subjects
08 Information And Computing Sciences
Artificial Intelligence & Image Processing
Publication Status
Published
Start Date
2017-10-30
Coverage Spatial
Nice, France