English
Related papers

Related papers: Contrastive Explanations for Argumentation-Based C…

200 papers

Defeasible reasoning is a kind of reasoning where some generalisations may not be valid in all circumstances, that is general conclusions may fail in some cases. Various formalisms have been developed to model this kind of reasoning, which…

Artificial Intelligence · Computer Science 2024-03-06 Gabriele Sacco , Loris Bozzato , Oliver Kutz

Cathoristic logic is a multi-modal logic where negation is replaced by a novel operator allowing the expression of incompatible sentences. We present the syntax and semantics of the logic including complete proof rules, and establish a…

Logic in Computer Science · Computer Science 2014-11-27 Richard Prideaux Evans , Martin Berger

This paper investigates the reliability of explanations generated by large language models (LLMs) when prompted to explain their previous output. We evaluate two kinds of such self-explanations - extractive and counterfactual - using three…

Computation and Language · Computer Science 2025-02-03 Korbinian Randl , John Pavlopoulos , Aron Henriksson , Tony Lindgren

Abductive explanations (AXp's) are widely used for understanding decisions of classifiers. Existing definitions are suitable when features are independent. However, we show that ignoring constraints when they exist between features may lead…

Artificial Intelligence · Computer Science 2024-09-19 Martin Cooper , Leila Amgoud

Justification theory is an abstract unifying formalism that captures semantics of various non-monotonic logics. One intriguing problem that has received significant attention is the consistency problem: under which conditions are…

Artificial Intelligence · Computer Science 2022-08-08 Simon Marynissen , Bart Bogaerts

Counterfactual explanations have been widely studied in explainability, with a range of application dependent methods emerging in fairness, recourse and model understanding. However, the major shortcoming associated with these methods is…

Machine Learning · Computer Science 2022-04-15 Dan Ley , Saumitra Mishra , Daniele Magazzeni

We propose a novel training regime termed counterfactual training that leverages counterfactual explanations to increase the explanatory capacity of models. Counterfactual explanations have emerged as a popular post-hoc explanation method…

Machine Learning · Computer Science 2026-01-23 Patrick Altmeyer , Aleksander Buszydlik , Arie van Deursen , Cynthia C. S. Liem

We present an approach for representing abstract argumentation frameworks based on an encoding into classical higher-order logic. This provides a uniform framework for computer-assisted assessment of abstract argumentation frameworks using…

Artificial Intelligence · Computer Science 2021-10-19 Alexander Steen , David Fuenmayor

Despite their enormous predictive power, machine learning models are often unsuitable for applications in regulated industries such as finance, due to their limited capacity to provide explanations. While model-agnostic frameworks such as…

Machine Learning · Statistics 2025-11-03 Joshua S. Harvey , Guanchao Feng , Sai Anusha Meesala , Tina Zhao , Dhagash Mehta

Convincing someone of the truth value of a premise requires understanding and articulating the core logical structure of the argument which proves or disproves the premise. Understanding the logical structure of an argument refers to…

Computation and Language · Computer Science 2025-08-21 Krunal Shah , Dan Roth

Transparency, user trust, and human comprehension are popular ethical motivations for interpretable machine learning. In support of these goals, researchers evaluate model explanation performance using humans and real world applications.…

Artificial Intelligence · Computer Science 2019-10-31 Bernease Herman

Ontologies formalise how the concepts from a given domain are interrelated. Despite their clear potential as a backbone for explainable AI, existing ontologies tend to be highly incomplete, which acts as a significant barrier to their more…

Artificial Intelligence · Computer Science 2021-05-12 Steven Schockaert , Yazmín Ibáñez-García , Víctor Gutiérrez-Basulto

We argue that robustness of explanations---i.e., that similar inputs should give rise to similar explanations---is a key desideratum for interpretability. We introduce metrics to quantify robustness and demonstrate that current methods do…

Machine Learning · Computer Science 2018-06-22 David Alvarez-Melis , Tommi S. Jaakkola

Interpretability and explainability have gained more and more attention in the field of machine learning as they are crucial when it comes to high-stakes decisions and troubleshooting. Since both provide information about predictors and…

Machine Learning · Computer Science 2024-04-26 Benjamin Leblanc , Pascal Germain

The concept of counterfactual explanations (CE) has emerged as one of the important concepts to understand the inner workings of complex AI systems. In this paper, we translate the idea of CEs to linear optimization and propose, motivate,…

Optimization and Control · Mathematics 2024-05-27 Jannis Kurtz , Ş. İlker Birbil , Dick den Hertog

Counterfactuals play a pivotal role in the two distinct data science fields of causal inference (CI) and explainable artificial intelligence (XAI). While the core idea behind counterfactuals remains the same in both fields--the examination…

Machine Learning · Statistics 2025-05-20 Galit Shmueli , David Martens , Jaewon Yoo , Travis Greene

In the absence of empirical confirmation, scientists may judge a theory's chances of being viable based on a wide range of arguments. The paper argues that such arguments can differ substantially with regard to their structural similarly to…

History and Philosophy of Physics · Physics 2017-02-07 Richard Dawid

We present some arguments for the thesis that a set-theoretic inspired faith, in the ability of intuitive truth to faithfully reflect relationships between elements of a Platonic universe, may be as misplaced as an assumption that such…

General Mathematics · Mathematics 2007-05-23 Bhupinder Singh Anand

We view voting rules as classifiers that assign a winner (a class) to a profile of voters' preferences (an instance). We propose to apply techniques from formal explainability, most notably abductive and contrastive explanations, to…

Artificial Intelligence · Computer Science 2024-08-27 Clément Contet , Umberto Grandi , Jérôme Mengin

In this paper, we compose a new task for deep argumentative structure analysis that goes beyond shallow discourse structure analysis. The idea is that argumentative relations can reasonably be represented with a small set of predefined…

Computation and Language · Computer Science 2017-12-08 Paul Reisert , Naoya Inoue , Naoaki Okazaki , Kentaro Inui