Related papers: Counterfactuals in Branching Time: The Weakest Sol…
In this work we prove the existence of Fathi's weak KAM solutions for periodic Lagrangians and give a construction of all of them.
Over the last two decades, there has been an extensive study on logical formalisms for specifying and verifying real-time systems. Temporal logics have been an important research subject within this direction. Although numerous logics have…
In many applications, it is important to be able to explain the decisions of machine learning systems. An increasingly popular approach has been to seek to provide \emph{counterfactual instance explanations}. These specify close possible…
Work in Counterfactual Explanations tends to focus on the principle of "the closest possible world" that identifies small changes leading to the desired outcome. In this paper we argue that while this approach might initially seem…
Counterfactual explanations are emerging as an attractive option for providing recourse to individuals adversely impacted by algorithmic decisions. As they are deployed in critical applications (e.g. law enforcement, financial lending), it…
Recently, several authors have criticized time-symmetrized quantum theory originated by the work of Aharonov et al. (1964). The core of this criticism was the proof, which appeared in various forms, showing that counterfactual…
Temporal reasoning with conditionals is more complex than both classical temporal reasoning and reasoning with timeless conditionals, and can lead to some rather counter-intuitive conclusions. For instance, Aristotle's famous "Sea Battle…
We present a new method for generating plausible counterfactual explanations for time series classification problems. The approach performs gradient-based optimization directly in the input space. To enforce plausibility, we integrate…
Neural network-based Marked Temporal Point Process (MTPP) models have been widely adopted to model event sequences in high-stakes applications, raising concerns about the trustworthiness of outputs from these models. This study focuses on…
We consider counterfactual explanations, the problem of minimally adjusting features in a source input instance so that it is classified as a target class under a given classifier. This has become a topic of recent interest as a way to…
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.…
This article deals with time-fractional diffusion equations with time-dependent singular source term. Whenever the order of the time-fractional derivative is either multi-term, distributed or space-dependent, we prove that the system admits…
We show a strong maximum principle and an Alexandrov-Bakelman-Pucci estimate for the weak solutions of a Cauchy problem featuring Caputo time-derivatives and non-local operators in space variables given in terms of Bernstein functions of…
Explainable Artificial Intelligence and Formal Argumentation have received significant attention in recent years. Argumentation-based systems often lack explainability while supporting decision-making processes. Counterfactual and…
Despite advancements in state-of-the-art models and information retrieval techniques, current systems still struggle to handle temporal information and to correctly answer detailed questions about past events. In this paper, we investigate…
Counterfactual explanations have been argued to be one of the most intuitive forms of explanation. They are typically defined as a minimal set of edits on a given data sample that, when applied, changes the output of a model on that sample.…
In this position paper we discuss three main shortcomings of existing approaches to counterfactual causality from the computer science perspective, and sketch lines of work to try and overcome these issues: (1) causality definitions should…
An analysis using classical stochastic processes is used to construct a consistent system of quantum counterfactual reasoning. When applied to a counterfactual version of Hardy's paradox, it shows that the probabilistic character of quantum…
The semantics for counterfactuals due to David Lewis has been challenged on the basis of unlikely, or impossible, events. Such events may skew a given similarity order in favour of those possible worlds which exhibit them. By updating the…
Counterfactual communication protocols are analysed using three approaches: a classical argument, the weak trace criterion, and the Fisher information criterion. It is argued that the classical analysis leads to contradiction and should…