Work

Algorithms for computing the set of acceptable arguments

Year: 2025

Type: article

Abstract: We investigate the computational problem of determining the set of acceptable arguments in abstract argumentation wrt. credulous and skeptical reasoning under grounded, complete, stable, and preferred semantics. In particular, we investigate the computational complexity of that problem and its verification variant, and develop several algorithms for all problem variants, including two baseline approaches based on iterative acceptability queries and extension enumeration, and some optimised versions. We experimentally compare the runtime performance of these algorithms: our results show that our newly optimised algorithms significantly outperform the baseline algorithms in most cases.

Source: International Journal of Approximate Reasoning

DOI: 10.1016/j.ijar.2025.109478

Authors: Lars Bengel, Matthias Thimm, Federico Cerutti, Mauro Vallati

Institutions: FernUniversität in Hagen, University of Brescia, University of Huddersfield

Language: English

Topic: Multi-Agent Systems and Negotiation

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,050

Funder: Deutsche Forschungsgemeinschaft