Abstract
Abstract dialectical frameworks (ADFs) constitute one of the most powerful formalisms in abstract argumentation. Their high computational complexity poses, however, certain challenges when designing efficient systems. In this paper, we tackle this issue by (i) analyzing the complexity of ADFs under structural restrictions, (ii) presenting novel algorithms which make use of these insights, and (iii) implementing these algorithms via (multiple) calls to SAT solvers. An empirical evaluation of the resulting implementation on ADF benchmarks generated from ICCMA competitions shows that our solver is able to outperform state-of-the-art ADF systems.
Original language | English |
---|---|
Article number | 103697 |
Journal | Artificial Intelligence |
Volume | 307 |
DOIs | |
Publication status | Published - Jun 2022 |
Keywords
- Abstract dialectical frameworks
- Complexity analysis
- SAT-based procedures
ASJC Scopus subject areas
- Artificial Intelligence
- Language and Linguistics
- Linguistics and Language