29.10.2024

Our group organizes the next edition of the International Competitions on Computational Models of Argumentation (ICCMA) in 2025. Call for solvers and benchmarks can be found here. The aim of the competition is to further development of solvers for (hard) reasoning tasks in computational argumentation.

5.9.2024

Our work "A Semantical Approach to Abstraction in Answer Set Programming and Assumption-based Argumentation" was accepted to this year's edition of LPNMR. Following the theme of the conference, non-monotonic reasoning and logic programming, we investigate forms of abstractions on logic programs under the answer set semantics and on the related assumption-based argumentation formalism.

11.07.2024

In this year's edition of the International Conference on Principles of Knowledge Representation and Reasoning (KR'24), three of our works got accepted:

• Complexity Results and Algorithms for Preferential Argumentative Reasoning in ASPIC+
• Abstraction in Assumption-based Argumentation
• Advancing Algorithmic Approaches to Probabilistic Argumentation under the Constellation Approach

In the first work, we extend computational approaches to the prominent structured argumentation formalism of ASPIC+, in particular incorporating also preferential argumentative reasoning. In the second work we deal with abstracting information to attain a high-level view aimed at supporting explainability. In the third work we studied alorithmic approaches to the highly complex field of probabilistic reasoning in formal argumentation.

9.7.2024

Wallner gave an invited talk at the Workshop on Recent Trends in Formal Argumentation at TU Wien on the topic "Instantiations and Computational Aspects of Assumption-based Argumentation". This workshop discussed recent advances in the field of computational argumentation. 

14.06.2024

Three of our works are accepted to COMMA 2024, a conference dedicated to computational argumentation. In the first work "Value-based Reasoning in ASPIC+" we investigate how value-based reasoning can be integrated in the argumentation formalism ASPIC+. In "On Computing Admissibility in ABA" we look at algorithmic approaches that compute compact representations of admissible sets of arguments in non-flat assumption-based argumentation. In the third work, "Complexity of Semi-Stable Semantics in Abstract Dialectical Frameworks", we extend the current state-of-the-art complexity analysis on abstract dialectical frameworks, by considering the recently introduced semi-stable semantics.