On Computing Admissibility in ABA

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.

DOI

10.3233/FAIA240315

Citation

Lehtonen, T, Rapberger, A, Toni, F, Ulbricht, M & Wallner, J P 2024, On Computing Admissibility in ABA . in Computational Models of Argument : Proceedings of COMMA 2024 . Frontiers in Artificial Intelligence and Applications, vol. 388, IOS Press, pp. 121-132, International Conference on Computational Models of Argument, Hagen, Germany, 18/09/2024 . https://doi.org/10.3233/FAIA240315

Permanent link to this item

https://urn.fi/URN:NBN:fi:aalto-202412318220

Collections

[article-cris] Perustieteiden korkeakoulu / SCI

Show all metadata

On Computing Admissibility in ABA

Access rights

URL

Journal Title

Journal ISSN

Volume Title

Authors

Date

Department

Major/Subject

Mcode

Degree programme

Language

Pages

Series

Abstract

Description

Keywords

Other note

DOI

Citation

Permanent link to this item

Collections