In this section
@inproceedings{Lehtonen:2024:10.3233/FAIA240315,
author = {Lehtonen, T and Rapberger, A and Toni, F and Ulbricht, M and Wallner, JP},
doi = {10.3233/FAIA240315},
pages = {121--132},
publisher = {IOS Press, Inc.},
title = {On computing admissibility in ABA},
url = {http://dx.doi.org/10.3233/FAIA240315},
year = {2024}
}
TY - CPAPER
AB - Most existing computational tools for assumption-based argumentation (ABA) focus on so-called flat frameworks, disregarding the more general case. Here, we study an instantiation-based approach for reasoning in possibly non-flat ABA. For complete-based semantics, an approach of this kind was recently introduced, based on a semantics-preserving translation between ABA and bipolar argumentation frameworks (BAFs). Admissible semantics, however, require us to consider an extension of BAFs which also makes use of premises of arguments (pBAFs).We explore basic properties of pBAFs which we require as a theoretical underpinning for our proposed instantiation-based solver for non-flat ABA under admissible semantics. As our empirical evaluation shows, depending on the ABA instances, the instantiation-based solver is competitive against an ASP-based approach implemented in the style of state-of-the-art solvers for hard argumentation problems.
AU - Lehtonen,T
AU - Rapberger,A
AU - Toni,F
AU - Ulbricht,M
AU - Wallner,JP
DO - 10.3233/FAIA240315
EP - 132
PB - IOS Press, Inc.
PY - 2024///
SP - 121
TI - On computing admissibility in ABA
UR - http://dx.doi.org/10.3233/FAIA240315
UR - https://ebooks.iospress.nl/volumearticle/69215
UR - http://hdl.handle.net/10044/1/113762
ER -