A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation
[article]
2021
arXiv
pre-print
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
arXiv:2108.04192v1
fatcat:hlp6weg6cbc27p7vk5xxnzkxxe