Abstract dialectical frameworks (ADFs) constitute one of the most powerful formalismsin abstract argumentation. Their high computational complexity poses, however, certainchallenges when designing efficient systems. In this paper, we tackle this issue by(i) analyzing the complexity of ADFs under structural restrictions, (ii) presenting novelalgorithms which make use of these insights, and (iii) implementing these algorithms via(multiple) calls to SAT solvers. An empirical evaluation of the resulting implementationon ADF benchmarks generated from ICCMA competitions shows that our solver is able tooutperform state-of-the-art ADF systems
Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving
Marco Maratea;
2022-01-01
Abstract
Abstract dialectical frameworks (ADFs) constitute one of the most powerful formalismsin abstract argumentation. Their high computational complexity poses, however, certainchallenges when designing efficient systems. In this paper, we tackle this issue by(i) analyzing the complexity of ADFs under structural restrictions, (ii) presenting novelalgorithms which make use of these insights, and (iii) implementing these algorithms via(multiple) calls to SAT solvers. An empirical evaluation of the resulting implementationon ADF benchmarks generated from ICCMA competitions shows that our solver is able tooutperform state-of-the-art ADF systemsFile in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
