KRR Group News 2022


Talk at NAVAS workshop 2022 in Vienna

We will give a talk about our recent work on "Existential Abstraction on Argumentation Frameworks via Clustering" in the upcoming NAVAS workshop 2022 in Vienna. This workshop is organized by research groups at TU Wien and TU Dresden. 


Paper accepted to KR'22

Our paper "Computing Stable Conclusions under the Weakest-Link Principle in the ASPIC+ Argumentation Formalism" was accepted to KR 2022. In this work, we look at argumentative reasoning including preferential information in the formalisms called ASPIC+. We derive novel complexity results, algorithms, and an empirically evaluated prototype for this formalism.


Article accepted to Artificial Intelligence

Our paper "Advanced Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving" was accepted to the Artificial Intelligence journal. In this article we investigate computational complexity, develop algorithms, and present a prototypical implementation, for Abstract Dialectical Frameworks (ADFs), which are a formalization of arguments and their relationships within the area of Computational Argumentation. We study several fragments of the formal language of ADFs and show complexity results for these fragments. Based on these insights, we develop algorithmic approaches to solve reasoning tasks on ADFs, and present an empirical evaluation of resulting prototypical implementations. More information in pure


PhD student positions

We have two openings for PhD students on the topic of knowledge representation and reasoning. See Jobs.


KRR Group News 2021


Paper accepted to AAAI'22

Our paper "An Axiomatic Approach to Revising Preferences" was accepted to AAAI 2022. In this paper we study a general approach to revision of preferences, along the lines of the well-known AGM approach to (belief) revision in AI, which bases revision operations on rationality postulates (formal properties stating desirable or interesting behavior). More information in pure.


New project grant awarded by FWF

The Austrian Science Fund (FWF) awarded a new research project grant to Wallner as the principle investigator (PI). The project is planned for three years, and provides foundational research for computational models of argumentation within the larger area of Artificial Intelligence.


Chapter in Handbook of Formal Argumentation

Wallner contributed to a chapter of the recent Handbook of Formal Argumentation, second volume. This handbook is an effort of the research community on Computational Argumentation to provide a thorough overview of major strands of the field. More information in pure.


Paper accepted to TPLP

In the paper "Harnessing Incremental ASP Solving for Reasoning in Assumption-Based Argumentation" we develop novel algorithms based on counterexample-guided abstraction refinement and incremental answer set programming (ASP) to address challenging computational problems in assumption-based argumentation. More information in pure.


Paper accepted to KR

In the paper "Existential Abstraction on Argumentation Frameworks via Clustering" we investigate abstraction techniques for simplification of argumentation scenarios, with the inherent aim to balance simplification and spuriousness (wrong conclusions drawn solely due to the abstraction), which is an inherent issue in abstraction. More information in pure.


Paper accepted to JAIR

The article "Declarative Algorithms and Complexity Results for Assumption-Based Argumentation" establishes novel complexity-theoretic and algorithmic advances for the formalism of assumption-based argumentation within the wider field of computational argumentation in AI. More information in pure.