English
Related papers

Related papers: Why this and not that? A Logic-based Framework for…

200 papers

Several formal systems, such as resolution and minimal model semantics, provide a framework for logic programming. In this paper, we will survey the use of structural proof theory as an alternative foundation. Researchers have been using…

Logic in Computer Science · Computer Science 2021-11-02 Dale Miller

While explainability is a desirable characteristic of increasingly complex black-box models, modern explanation methods have been shown to be inconsistent and contradictory. The semantics of explanations is not always fully understood - to…

Artificial Intelligence · Computer Science 2024-08-09 Omer Reingold , Judy Hanwen Shen , Aditi Talati

There are some recent approaches and results about the use of answer-set programming for specifying counterfactual interventions on entities under classification, and reasoning about them. These approaches are flexible and modular in that…

Artificial Intelligence · Computer Science 2021-08-26 Leopoldo Bertossi

This paper is an attempt to solve the following problem: given a logic, how to turn it into a paraconsistent one? In other words, given a logic in which \emph{ex falso quodlibet} holds, how to convert it into a logic not satisfying this…

Logic · Mathematics 2016-06-13 Edelcio G. de Souza , Alexandre Costa-Leite , Diogo H. B. Dias

Explaining why an answer is (or is not) returned by a query is important for many applications including auditing, debugging data and queries, and answering hypothetical questions about data. In this work, we present the first practical…

Databases · Computer Science 2018-08-20 Seokki Lee , Bertram Ludaescher , Boris Glavic

Understanding why a classification model prefers one class over another for an input instance is the challenge of contrastive explanation. This work implements concept-based contrastive explanations for image classification by leveraging…

Computer Vision and Pattern Recognition · Computer Science 2025-07-01 Yuliia Kaidashova , Bettina Finzel , Ute Schmid

Post-hoc explanations of machine learning models are crucial for people to understand and act on algorithmic predictions. An intriguing class of explanations is through counterfactuals, hypothetical examples that show people how to obtain a…

Machine Learning · Computer Science 2019-12-09 Ramaravind Kommiya Mothilal , Amit Sharma , Chenhao Tan

Counterfactual reasoning, a cornerstone of human cognition and decision-making, is often seen as the 'holy grail' of causal learning, with applications ranging from interpreting machine learning models to promoting algorithmic fairness.…

Machine Learning · Computer Science 2025-04-11 Yahya Aalaila , Gerrit Großmann , Sumantrak Mukherjee , Jonas Wahl , Sebastian Vollmer

Many tasks in statistical and causal inference can be construed as problems of \emph{entailment} in a suitable formal language. We ask whether those problems are more difficult, from a computational perspective, for \emph{causal}…

Logic in Computer Science · Computer Science 2023-06-02 Milan Mossé , Duligur Ibeling , Thomas Icard

Mutual understanding of artificial agents' decisions is key to ensuring a trustworthy and successful human-robot interaction. Hence, robots are expected to make reasonable decisions and communicate them to humans when needed. In this…

Robotics · Computer Science 2026-03-18 Alberto Olivares-Alarcos , Sergi Foix , Júlia Borràs , Gerard Canal , Guillem Alenyà

Counterfactual explanations are gaining prominence within technical, legal, and business circles as a way to explain the decisions of a machine learning model. These explanations share a trait with the long-established "principal reason"…

Computers and Society · Computer Science 2019-12-12 Solon Barocas , Andrew D. Selbst , Manish Raghavan

Providing explanations about how machine learning algorithms work and/or make particular predictions is one of the main tools that can be used to improve their trusworthiness, fairness and robustness. Among the most intuitive type of…

Machine Learning · Computer Science 2024-04-12 Rubén Ruiz-Torrubiano

In this paper we propose a novel method that provides contrastive explanations justifying the classification of an input by a black box classifier such as a deep neural network. Given an input we find what should be %necessarily and…

Artificial Intelligence · Computer Science 2018-10-30 Amit Dhurandhar , Pin-Yu Chen , Ronny Luss , Chun-Chen Tu , Paishun Ting , Karthikeyan Shanmugam , Payel Das

In this paper we show several similarities among logic systems that deal simultaneously with deductive and quantitative inference. We claim it is appropriate to call the tasks those systems perform as Quantitative Logic Reasoning. Analogous…

Logic in Computer Science · Computer Science 2019-05-15 Marcelo Finger

Recent papers in explainable AI have made a compelling case for counterfactual modes of explanation. While counterfactual explanations appear to be extremely effective in some instances, they are formally equivalent to adversarial examples.…

Artificial Intelligence · Computer Science 2020-12-21 Kieran Browne , Ben Swift

Many satisfiability modulo theories solvers implement a variant of the DPLL(T ) framework which separates theory-specific reasoning from reasoning on the propositional abstraction of the formula. Such solvers conclude that a formula is…

Logic in Computer Science · Computer Science 2015-06-05 Liana Hadarean , Alex Horn , Tim King

We present a computationally grounded semantics for counterfactual conditionals in which i) the state in a model is decomposed into two elements: a propositional valuation and a causal base in propositional form that represents the causal…

Logic in Computer Science · Computer Science 2025-05-21 Carlos Aguilera-Ventura , Xinghan Liu , Emiliano Lorini , Dmitry Rozplokhas

Recent XAI studies have investigated what constitutes a \textit{good} explanation in AI-assisted decision-making. Despite the widely accepted human-friendly properties of explanations, such as contrastive and selective, existing studies…

Computers and Society · Computer Science 2025-05-05 Yongsu Ahn , Yu-Ru Lin , Malihe Alikhani , Eunjeong Cheon

We argue that reducing nonlinear programming problems to a simple canonical form is an effective way to analyze them, specially when the problem is degenerate and the usual linear independence hypothesis does not hold. To illustrate this…

Optimization and Control · Mathematics 2018-04-02 Walter F. Mascarenhas

There is a growing interest in understanding arguments' strength in Quantitative Bipolar Argumentation Frameworks (QBAFs). Most existing studies focus on attribution-based methods that explain an argument's strength by assigning importance…

Artificial Intelligence · Computer Science 2024-11-12 Xiang Yin , Nico Potyka , Francesca Toni