New Algorithm for Splitting Assumption-Based Argumentation Frameworks
A new algorithm for splitting assumption-based argumentation frameworks (ABAFs) has been proposed to reduce computational complexity. The method applies a divide-and-conquer strategy, computing extensions incrementally by restricting the search space to sub-frameworks and combining results. This approach addresses high computational costs in ABA, which are exacerbated when frameworks are instantiated into graph-based formalisms like Dung's AFs and SETAFs. The work is published on arXiv under identifier 2604.27964.
Key facts
- Assumption-Based Argumentation (ABA) is a formalism for modeling debates.
- High computational complexity of core reasoning tasks in ABA poses challenges.
- Complexity increases when ABA frameworks are instantiated into AFs and SETAFs.
- Divide-and-conquer algorithms are used to address computational intractability.
- Splitting computes extensions incrementally by restricting search to sub-frameworks.
- The new algorithm applies splitting to ABA frameworks.
- The paper is available on arXiv with ID 2604.27964.
- The approach aims to optimize reasoning over knowledge bases.
Entities
Institutions
- arXiv