Abstract
AbstractWe address complex reasoning tasks in assumption-based argumentation (ABA) by developing dynamic programming algorithms based on tree-decompositions. As one of the prominent approaches in computational argumentation, our focus is on NP-hard reasoning in ABA. We utilize tree-width, a structural measure describing closeness to trees, for an approach to handle computationally complex tasks in ABA. We contribute to the state of the art by first showing that many reasoning tasks in ABA are fixed-parameter tractable w.r.t. tree-width using Courcelle’s theorem, informally signaling wide applicability of dynamic programming algorithms for ABA. Secondly, we develop such algorithms operating on tree-decompositions of given ABA frameworks. We instantiate the algorithms in the recent D-FLAT framework allowing for declarative and extensible specification of dynamic programming algorithms. In an experimental evaluation on a resulting prototype, we show promise of the approach in particular for complex counting tasks.
Publisher
Springer Nature Switzerland
Reference53 articles.
1. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);M Abseher,2014
2. Abseher, M., Bliem, B., Hecher, M., Moldovan, M., Woltran, S.: Dynamic programming on tree decompositions with D-FLAT. Künstliche Intell. 32(2–3), 191–192 (2018)
3. Atkinson, K., et al.: Towards artificial argumentation. AI Mag. 38(3), 25–36 (2017)
4. Baroni, P., Gabbay, D., Giacomin, M., van der Torre, L. (eds.): Handbook of Formal Argumentation. College Publications (2018)
5. Besnard, P., et al.: Introduction to structured argumentation. Argument Comput. 5(1), 1–4 (2014)