DIAMOND: a system for computing with abstract dialectical frameworks. This paper briefly describes the DIAMOND system, version 2.0.0, in its role as submission to the First International Competition on Computational Models of Argumentation (ICCMA). DIAMOND is essentially a collection of answer set programming (ASP) encodings of semantics of abstract dialectical frameworks (ADFs) together with a wrapper script that calls an ASP solver with adequate encodings for a given instance, semantics and reasoning problem.
Keywords for this software
References in zbMATH (referenced in 9 articles )
Showing results 1 to 9 of 9.
- Gaggl, Sarah Alice; Rudolph, Sebastian; Straß, Hannes: On the decomposition of abstract dialectical frameworks and the complexity of naive-based semantics (2021)
- Brewka, Gerhard; Diller, Martin; Heissenberger, Georg; Linsbichler, Thomas; Woltran, Stefan: Solving advanced argumentation problems with answer set programming (2020)
- Gaggl, Sarah A.; Linsbichler, Thomas; Maratea, Marco; Woltran, Stefan: Design and results of the second international competition on computational models of argumentation (2020)
- Pührer, Jörg: Realizability of three-valued semantics for abstract dialectical frameworks (2020)
- Gottifredi, Sebastian; Cohen, Andrea; García, Alejandro J.; Simari, Guillermo R.: Characterizing acceptability semantics of argumentation frameworks with recursive attack and support relations (2018)
- Thimm, Matthias; Villata, Serena: The first international competition on computational models of argumentation: results and analysis (2017)
- Polberg, Sylwia: Understanding the abstract dialectical framework (2016)
- Eiter, Thomas; Strass, Hannes; Truszczyński, Mirosław; Woltran, Stefan: A glimpse on Gerhard Brewka’s contributions to artificial intelligence (2015)
- Strass, Hannes; Wallner, Johannes Peter: Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory (2015)