Lisbon, Portugal. July 20-23, 2026.
ISSN: 2334-1033
ISBN: 978-1-956792-18-8
Copyright © 2026 International Joint Conferences on Artificial Intelligence Organization
ABA Learning is a recent approach for obtaining Assumption-based Argumentation (ABA) frameworks by reasoning with transformation rules from background knowledge and positive/negative examples of concepts of interest.
ABA Learning relies on credulous reasoning under a specific semantic notion of extensions for ABA, namely that of stable extensions.
In this paper, we newly frame the problem in terms of credulous reasoning under any semantic notion of extensions for ABA.
Focusing on admissible, complete, grounded, preferred as well as stable extensions, we present X-ABALearn, a novel parametric algorithm (with X any ABA semantics) based on variants of the transformation
rules of ABA Learning and an implementation thereof in Answer Set Programming.
Finally, we explore the use of (our implementation of) X-ABALearn on several learning problems, including tabular data and beyond.