Splitting Assumption-Based Argumentation Frameworks

Abstract

In this paper, we study the concept of splitting in Assumption-Based Argumentation (ABA). This provides a divide-and-conquer strategy for addressing computational intractability of core reasoning tasks in ABA. In particular, we show how extensions of a given framework can be computed incrementally by restricting the search space to sub-frameworks only, and then combining the obtained results. We first consider splitting on the argument-graph induced by an ABAF, and later adapt the approach to ABA frameworks, in order to avoid the potentially high cost of building the graph.