Hostname: page-component-89b8bd64d-j4x9h Total loading time: 0 Render date: 2026-05-09T13:13:01.587Z Has data issue: false hasContentIssue false

Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation

Published online by Cambridge University Press:  22 November 2021

TUOMO LEHTONEN
Affiliation:
University of Helsinki, Helsinki, Finland (e-mail: tuomo.lehtonen@helsinki.fi)
JOHANNES P. WALLNER
Affiliation:
Graz University of Technology, Graz, Austria (e-mail: wallner@ist.tugraz.at)
MATTI JӒRVISALO
Affiliation:
University of Helsinki, Helsinki, Finland (e-mail: matti.jarvisalo@helsinki.fi)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Assumption-based argumentation (ABA) is a central structured argumentation formalism. As shown recently, answer set programming (ASP) enables efficiently solving NP-hard reasoning tasks of ABA in practice, in particular in the commonly studied logic programming fragment of ABA. In this work, we harness recent advances in incremental ASP solving for developing effective algorithms for reasoning tasks in the logic programming fragment of ABA that are presumably hard for the second level of the polynomial hierarchy, including skeptical reasoning under preferred semantics as well as preferential reasoning. In particular, we develop non-trivial counterexample-guided abstraction refinement procedures based on incremental ASP solving for these tasks. We also show empirically that the procedures are significantly more effective than previously proposed algorithms for the tasks.

Information

Type
Original Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2021. Published by Cambridge University Press
Supplementary material: PDF

Lehtonen et al. supplementary material

Lehtonen et al. supplementary material

Download Lehtonen et al. supplementary material(PDF)
PDF 101.7 KB