TY - GEN
T1 - Investigating subclasses of abstract dialectical frameworks
AU - Diller, M.
AU - Keshavarzi Zafarghandi, A.
AU - Linsbichler, T.
AU - Woltran, S.
PY - 2018
Y1 - 2018
N2 - © 2018 The authors and IOS Press.Dialectical frameworks (ADFs) are generalizations of Dung argumentation frameworks where arbitrary relationships among arguments can be formalized. This additional expressibility comes with the price of higher computational complexity, thus an understanding of potentially easier subclasses is essential. Compared to Dung argumentation frameworks, where several subclasses such as acyclic and symmetric frameworks are well understood, there has been no in-depth analysis for ADFs in such direction yet (with the notable exception of bipolar ADFs). In this work, we introduce certain subclasses of ADFs and investigate their properties. In particular, we show that for acyclic ADFs, the different semantics coincide. On the other hand, we show that the concept of symmetry is less powerful for ADFs and further restrictions are required to achieve results that are similar to the known ones for Dung's frameworks. We also provide experiments to analyse the performance of solvers when applied to particular subclasses of ADFs.
AB - © 2018 The authors and IOS Press.Dialectical frameworks (ADFs) are generalizations of Dung argumentation frameworks where arbitrary relationships among arguments can be formalized. This additional expressibility comes with the price of higher computational complexity, thus an understanding of potentially easier subclasses is essential. Compared to Dung argumentation frameworks, where several subclasses such as acyclic and symmetric frameworks are well understood, there has been no in-depth analysis for ADFs in such direction yet (with the notable exception of bipolar ADFs). In this work, we introduce certain subclasses of ADFs and investigate their properties. In particular, we show that for acyclic ADFs, the different semantics coincide. On the other hand, we show that the concept of symmetry is less powerful for ADFs and further restrictions are required to achieve results that are similar to the known ones for Dung's frameworks. We also provide experiments to analyse the performance of solvers when applied to particular subclasses of ADFs.
UR - http://www.scopus.com/inward/record.url?scp=85053886570&partnerID=8YFLogxK
U2 - 10.3233/978-1-61499-906-5-61
DO - 10.3233/978-1-61499-906-5-61
M3 - Conference contribution
SN - 9781614999058
T3 - Frontiers in Artificial Intelligence and Applications
SP - 61
EP - 72
BT - Computational Models of Argument - Proceedings of COMMA 2018
A2 - Modgil, S.
A2 - Budzynska, K.
A2 - Lawrence, J.
PB - IOS Press
T2 - 7th International Conference on Computational Models of Argument, COMMA 2018
Y2 - 12 September 2018 through 14 September 2018
ER -