ASPARTIX -
Answer Set Programming Argumentation Reasoning Tool
Welcome to the system page of our ASP-based argumentation system ASPARTIX for Dung style abstract argumentation and extensions thereof.
Contents
News
31.03.2021
Update of Dung AF page. Incorporating ICCMA'21 version, domain heuristics, multi-shot encodings, ...
28.06.2018
Relaunch of the ASPARTIX Webpage.
(For the previous Version see our archive)
ASPARTIX for ...
ASPARTIX supports reasoning in Dung AFs and several formalisms built on top of them. For more details please follow the links below.
- Dung AFs: The core of the ASPARTIX system. Provides encodings to compute extensions or perform credulous/skeptical reasoning in abstract argumentation frameworks. Supports a broad range of argumentation semantics.
- Preference-based AFs (PAFs): Preference-based Argumentation Frameworks
- Value-based AFs (VAFs): Value-based Argumentation Frameworks
- Bipolar AFs (BAFs): Bipolar Argumentation Frameworks (extend Dung AFs by a support relation)
- Extended AFs (EAFs): ASP Encodings to compute the extensions of Modgil's Extended Argumentation Frameworks allowing for attacks on attacks.
- AFRAs: Computes extensions for argumentation framework with recursive attacks, based on a translation to Dung AFs.
- SETAFs: Computes extensions for Argumentation framework with collective attacks, i.e., attacks where a non-empty set S of arguments attacks an argument a.
- Claim-augmented AFs (CAFs): Computes extensions in terms of claim of arguments.
ASPARTIX system demo from COMMA 2020
About
The development of ASPARTIX started with Sarah Gaggl's Master's Thesis "Solving Argumentation Frameworks using Answer Set Programming" where a DLV program has been implemented. With this implementation, it is not only possible to compute the standard extensions for classical argumentation frameworks defined by Dung, but also for preference-based AF's (PAF's), value-based AF's (VAF's) and bipolar AF's (BAF's). In the latter case, it is also possible to compute save and complete extensions, as well as distinguish between the classical d-admissible (following Dung), s-admissible (for stable) and c-admissible (for closed) extensions, for which also the respective preferred extensions are available.
The system has then been further developed under the project "New Methods for Analyzing, Comparing, and Solving Argumentation Problems" (supported by the Wiener Wissenschafts-, Forschungs- und Technologiefonds WWTF under grant ICT 08-028). We were are able to provide encodings for semi-stable, ideal, stage, resolution-based grounded, cf2 and stage2 semantics.
We consistently provide our newest results, so that it is worth to have a look at the webpage from time to time.
Archive
For older versions of this page please have a look at the archive.
Contact
For further information please contact aspartix@dbai.tuwien.ac.at.
Disclaimer
The aim of this page is to share tools we developed in our research with the research community. All the software is provided "AS IS", without warranty of any kind.
References
2021 | |
| [31] |
ASPARTIX-V - A Solver for Argumentation Tasks Using ASP Wolfgang Dvořák, Matthias König, Anna Rapberger, Johannes Peter Wallner, Stefan Woltran ASPOCP 2021 [ paper ] |
| [30] |
ASPARTIX-V21 Wolfgang Dvořák, Matthias König, Johannes Peter Wallner, Stefan Woltran ICCMA 2021 [ paper ] |
2020 | |
| [29] |
The ASPARTIX System Suite Wolfgang Dvořák, Sarah Alice Gaggl, Anna Rapberger, Johannes Peter Wallner, Stefan Woltran COMMA 2020: 461-462 [ paper at IOS Press ] |
| [28] |
Computing Strongly Admissible Sets Wolfgang Dvořák, Johannes P. Wallner COMMA 2020: 179-190 [ paper at IOS Press ] |
| [27] |
ASPARTIX-V19 - An Answer-set Programming based System for Abstract Argumentation Wolfgang Dvořák, Anna Rapberger, Johannes P. Wallner, Stefan Woltran FoIKS 2020: 79-89 [ paper at Springer ] |
2019 | |
| [26] |
Argumentation Frameworks with Claims and Collective Attacks -- Complexity Results and Answer-Set Programming Encodings
Alexander Greßler Masters Thesis, Technische Universität Wien, 2019 [ .pdf ] |
2018 | |
| [25] |
Evaluating SETAFs via Answer-Set Programming Wolfgang Dvořák, Alexander Greßler, and Stefan Woltran SAFA 2018 |
| [24] |
Evaluating SETAFs via Answer-Set Programming Wolfgang Dvořák, Alexander Greßler, and Stefan Woltran Technical Report DBAI-TR-2018-112, Technische Universität Wien, 2018. [ .pdf ] |
2016 | |
| [23] |
Stage semantics and the SCC-recursive schema for argumentation semantics. Wolfgang Dvořák and Sarah Alice Gaggl J. Log. Comput. 26(4): 1149-1202 (2016) |
2015 | |
| [22] |
ASPARTIX-D: ASP Argumentation Reasoning Tool - Dresden. Sarah Alice Gaggl and Norbert Manthey System Descriptions of the First International Competition on Computational Models of Argumentation (ICCMA'15) [arXiv:1510.05373] |
| [21] |
ASPARTIX-V: Utilizing Improved ASP Encodings. Alessandro Ronca, Johannes Peter Wallner, and Stefan Woltran System Descriptions of the First International Competition on Computational Models of Argumentation (ICCMA'15) [arXiv:1510.05373] |
| [20] |
Methods for solving reasoning problems in abstract argumentation - A survey. Günther Charwat, Dvořák, Sarah Alice Gaggl, Johannes Peter Wallner, Stefan Woltran Artif. Intell. 220: 28-63 (2015) |
| [19] |
Improved answer-set programming encodings for abstract argumentation. Sarah Alice Gaggl, Norbert Manthey, Alessandro Ronca, Johannes Peter Wallner, Stefan Woltran TPLP 15(4-5): 434-448 (2015) [paper] |
| [18] |
Reduction-Based Approaches to Implement Modgil's Extended Argumentation Frameworks. Dvořák, Sarah Alice Gaggl, Thomas Linsbichler, Johannes Peter Wallner: Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation 2015: 249-264 |
2013 | |
| [17] |
The cf2 argumentation semantics revisited. Sarah Gaggl and Stefan Woltran J. Log. Comput. 23(5): 925-949 (2013) |
2012 | |
| [16] |
Computational Aspects of cf2 and stage2 Argumentation Semantics. Wolfgang Dvořák and Sarah Gaggl COMMA 2012: 273-284 |
2011 | |
| [15] |
Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems. Wolfgang Dvořák, Sarah Alice Gaggl, Johannes Wallner and Stefan Woltran INAP 2011 (technical paper) [arXiv:1108.4942] |
| [14] |
Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems.
Wolfgang Dvořák, Sarah Gaggl, Johannes Wallner, and Stefan Woltran. Technical Report DBAI-TR-2011-70, Technische Universität Wien, 2011. [ bib | .pdf ] |
| [13] |
Manifold Answer-Set Programs for Meta-Reasoning.
Wolfgang Faber and Stefan Woltran. In: M. Balduccini and T.C. Son (Eds.): Gelfond Festschrift, volumne 6565 of Lecture Notes in Artificial Intelligence, pages 44–63. Springer, Heidelberg (2011) [ bib ] |
2010 | |
| [12] |
Analysis of Grounders and Solvers for ASP Encodings of
Argumentation Frameworks. Michael Petritsch. Bachelor Thesis, Technische Universität Wien, Stefan Woltran supervisor, 2010. [.pdf ] |
| [11] |
cf2 Semantics Revisited. Sarah Gaggl and Stefan Woltran. In Pietro Baroni, Federico Cerutti, Massimiliano Giacomin, Guillermo R. Simari, editors, Proceedings of the Third International Conference on Computational Models of Argument (COMMA 2010), Desenzano del Garda, Italy, September 8-10, 2010, volume 216 of Frontiers in Artificial Intelligence and Applications, pages 243–254. IOS Press, 2010. [ bib |.pdf ] |
| [10] |
ASPARTIX Conquers the Web
Uwe Egly, Sarah Gaggl Paul Wandl, and Stefan Woltran. Software demonstration at COMMA 2010. [.pdf] |
| [9] |
Towards a General Argumentation System based on Answer-Set Programming. Sarah Gaggl. In ICLP (Technical Communications) 2010: 265-269.[pdf] |
| [8] |
Answer-Set Programming Encodings for Argumentation Frameworks. Uwe Egly, Sarah Gaggl, and Stefan Woltran. In Argument and Computation, 1(2): 147 - 177 (2010).[ bib |pdf] |
2009 | |
| [7] |
ASPARTIX: A System for Computing Different Argumentation
Semantics in Answer-Set Programming. Sarah Gaggl. Poster. ACAI'09 Poster Session. [.pdf ] |
| [6] |
Manifold Answer-Set Programs for Meta-Reasoning.
Wolfgang Faber and Stefan Woltran. In Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning, (LPNMR'09), Potsdam, Germany, September 14-18, 2009. [ bib | .pdf ] |
| [5] |
Manifold Answer-Set Programs for Meta-Reasoning.
Wolfgang Faber and Stefan Woltran. In Proceedings of the IJCAI-09 Workshop on Nonmonotonic Reasoning, Action and Change, (NRAC'09). [.pdf ] |
| [4] |
Solving Argumentation Frameworks using Answer Set Programming.
Sarah Gaggl. Masters Thesis, Technische Universität Wien, 2009 [.pdf ] |
2008 | |
| [3] |
ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming.
Uwe Egly, Sarah Gaggl, and Stefan Woltran. In Maria G. de la Banda and Enrico Pontelli, editors, Proceedings of the Twenty-Fourth International Conference on Logic Programming, (ICLP'08), Udine, Italy, December 9-13, 2008, volume 5366 of Lecture Notes in Computer Science, pages 734–738. Springer, 2008. [ bib | .pdf ] |
| [2] |
Answer-Set Programming Encodings for Argumentation Frameworks.
Uwe Egly, Sarah Gaggl, and Stefan Woltran. In 1st Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2008), Udine, Italy, 2008 [ bib | .pdf ] |
| [1] |
Answer-Set Programming Encodings for Argumentation Frameworks.
Uwe Egly, Sarah Gaggl, and Stefan Woltran. Technical Report DBAI-TR-2008-62, Technische Universität Wien, 2008 [ bib | .pdf ] |