activity
20212026
most citedContestable AI needs Computational Argumentation

6 citations · 9 across the 12 of their papers we have counts for

collaborators

13 papers

cs.AI2026

Splitting Argumentation Frameworks with Collective Attacks and Supports

Matti Berthold, Lydia Blümel, Giovanni Buraglio +1

This work proposes novel splitting techniques for argumentation formalisms that incorporate supports between defeasible elements. We base our studies on bipolar set-based argumenta…

cs.AI2025

Heterogeneous Graph Neural Networks for Assumption-Based Argumentation

Preesha Gehlot, Anna Rapberger, Fabrizio Russo +1

Assumption-Based Argumentation (ABA) is a powerful structured argumentation formalism, but exact computation of extensions under stable semantics is intractable for large framework…

cs.AI2025

On Strong and Weak Admissibility in Non-Flat Assumption-Based Argumentation

Matti Berthold, Lydia Blümel, Anna Rapberger

In this work, we broaden the investigation of admissibility notions in the context of assumption-based argumentation (ABA). More specifically, we study two prominent alternatives t…

cs.AI2025

Argumentative Debates for Transparent Bias Detection [Technical Report]

Hamed Ayoobi, Nico Potyka, Anna Rapberger +1

As the use of AI in society grows, addressing emerging biases is essential to prevent systematic discrimination. Several bias detection methods have been proposed, but, with few ex…

cs.AI2025

On Gradual Semantics for Assumption-Based Argumentation

Anna Rapberger, Fabrizio Russo, Antonio Rago +1

In computational argumentation, gradual semantics are fine-grained alternatives to extension-based and labelling-based semantics . They ascribe a dialectical strength to (component…

cs.HC2024

Visualizing Extensions of Argumentation Frameworks as Layered Graphs

Martin Nöllenburg, Christian Pirker, Anna Rapberger +2

The visualization of argumentation frameworks (AFs) is crucial for enabling a wide applicability of argumentative tools. However, their visualization is often considered only as an…

cs.AI2024

PeerArg: Argumentative Peer Review with LLMs

Purin Sukpanichnant, Anna Rapberger, Francesca Toni

Peer review is an essential process to determine the quality of papers submitted to scientific conferences or journals. However, it is subjective and prone to biases. Several studi…

cs.AI2024

Instantiations and Computational Aspects of Non-Flat Assumption-based Argumentation

Tuomo Lehtonen, Anna Rapberger, Francesca Toni +2

Most existing computational tools for assumption-based argumentation (ABA) focus on so-called flat frameworks, disregarding the more general case. In this paper, we study an instan…

cs.AI2024

Argumentative Causal Discovery

Fabrizio Russo, Anna Rapberger, Francesca Toni

Causal discovery amounts to unearthing causal relationships amongst features in data. It is a crucial companion to causal inference, necessary to build scientific knowledge without…

cs.AI2024★ 6 cited

Contestable AI needs Computational Argumentation

Francesco Leofante, Hamed Ayoobi, Adam Dejl +10

AI has become pervasive in recent years, but state-of-the-art approaches predominantly neglect the need for AI systems to be contestable. Instead, contestability is advocated by AI…

cs.AI2024

On the Correspondence of Non-flat Assumption-based Argumentation and Logic Programming with Negation as Failure in the Head

Anna Rapberger, Markus Ulbricht, Francesca Toni

The relation between (a fragment of) assumption-based argumentation (ABA) and logic programs (LPs) under stable model semantics is well-studied. However, for obtaining this relatio…

cs.AI2022★ 2 cited

The Effect of Preferences in Abstract Argumentation Under a Claim-Centric View

Michael Bernreiter, Wolfgang Dvorak, Anna Rapberger +1

In this paper, we study the effect of preferences in abstract argumentation under a claim-centric perspective. Recent work has revealed that semantical and computational properties…

cs.LO2021★ 1 cited

Concurrence for well-formed CAFs: Naive Semantics

Rafael Kiesel, Anna Rapberger

In the area of claim-based reasoning in abstract argumentation, a claim-based semantics is said to be concurrent in a given framework if all its variants yield the same extensions.…