Counterfactuals Modulo Temporal Logics

• URL: http://arxiv.org/abs/2306.08916v1
• Date: Thu, 15 Jun 2023 07:40:36 GMT
• Title: Counterfactuals Modulo Temporal Logics
• Authors: Bernd Finkbeiner and Julian Siber
• Abstract summary: Lewis' theory of counterfactuals is the foundation of many contemporary notions of causality. We extend this theory in the temporal direction to enable symbolic counterfactual reasoning on infinite sequences.
• Score: 1.90365714903665
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Lewis' theory of counterfactuals is the foundation of many contemporary notions of causality. In this paper, we extend this theory in the temporal direction to enable symbolic counterfactual reasoning on infinite sequences, such as counterexamples found by a model checker and trajectories produced by a reinforcement learning agent. In particular, our extension considers a more relaxed notion of similarity between worlds and proposes two additional counterfactual operators that close a semantic gap between the previous two in this more general setting. Further, we consider versions of counterfactuals that minimize the distance to the witnessing counterfactual worlds, a common requirement in causal analysis. To automate counterfactual reasoning in the temporal domain, we introduce a logic that combines temporal and counterfactual operators, and outline decision procedures for the satisfiability and trace-checking problems of this logic.

Related papers

• Counterfactual and Semifactual Explanations in Abstract Argumentation: Formal Foundations, Complexity and Computation [19.799266797193344]
  Argumentation-based systems often lack explainability while supporting decision-making processes. Counterfactual and semifactual explanations are interpretability techniques. We show that counterfactual and semifactual queries can be encoded in weak-constrained Argumentation Framework.
  arXiv  Detail & Related papers  (2024-05-07T07:27:27Z)
• Towards Trustworthy Explanation: On Causal Rationalization [9.48539398357156]
  We propose a new model of rationalization based on two causal desiderata, non-spuriousness and efficiency. The superior performance of the proposed causal rationalization is demonstrated on real-world review and medical datasets.
  arXiv  Detail & Related papers  (2023-06-25T03:34:06Z)
• Invariant Causal Set Covering Machines [64.86459157191346]
  Rule-based models, such as decision trees, appeal to practitioners due to their interpretable nature. However, the learning algorithms that produce such models are often vulnerable to spurious associations and thus, they are not guaranteed to extract causally-relevant insights. We propose Invariant Causal Set Covering Machines, an extension of the classical Set Covering Machine algorithm for conjunctions/disjunctions of binary-valued rules that provably avoids spurious associations.
  arXiv  Detail & Related papers  (2023-06-07T20:52:01Z)
• Unlocking Temporal Question Answering for Large Language Models with Tailor-Made Reasoning Logic [84.59255070520673]
  Large language models (LLMs) face a challenge when engaging in temporal reasoning. We propose TempLogic, a novel framework designed specifically for temporal question-answering tasks.
  arXiv  Detail & Related papers  (2023-05-24T10:57:53Z)
• The Transformation Logics [58.35574640378678]
  We introduce a new family of temporal logics designed to balance the trade-off between expressivity and complexity. Key feature is the possibility of defining operators of a new kind that we call transformation operators. We show them to yield logics capable of creating hierarchies of increasing expressivity and complexity.
  arXiv  Detail & Related papers  (2023-04-19T13:24:04Z)
• On the Complexity of Counterfactual Reasoning [9.614694312155795]
  We show that counterfactual reasoning is no harder than associational or interventional reasoning on fully specified SCMs. We extend our results to general counterfactual reasoning that requires contemplating more than two worlds.
  arXiv  Detail & Related papers  (2022-11-24T07:28:17Z)
• Logical Satisfiability of Counterfactuals for Faithful Explanations in NLI [60.142926537264714]
  We introduce the methodology of Faithfulness-through-Counterfactuals. It generates a counterfactual hypothesis based on the logical predicates expressed in the explanation. It then evaluates if the model's prediction on the counterfactual is consistent with that expressed logic.
  arXiv  Detail & Related papers  (2022-05-25T03:40:59Z)
• Approaches to causality and multi-agent paradoxes in non-classical theories [0.0]
  This thesis reports progress in the analysis of causality and multi-agent logical paradoxes in quantum and post-quantum theories. We develop techniques for using generalised entropies to analyse distinctions between classical and non-classical causal structures. We develop a framework for modelling cyclic and fine-tuned influences in non-classical theories.
  arXiv  Detail & Related papers  (2021-02-04T03:35:57Z)
• Temporal Answer Set Programming [3.263632801414296]
  We present an overview on Temporal Logic Programming under the perspective of its application for Knowledge Representation and declarative problem solving. We focus on recent results of the non-monotonic formalism called Temporal Equilibrium Logic (TEL) that is defined for the full syntax. In a second part, we focus on practical aspects, defining a syntactic fragment called temporal logic programs closer to ASP, and explain how this has been exploited in the construction of the solver TELINGO.
  arXiv  Detail & Related papers  (2020-09-14T16:13:36Z)
• Supporting Optimal Phase Space Reconstructions Using Neural Network Architecture for Time Series Modeling [68.8204255655161]
  We propose an artificial neural network with a mechanism to implicitly learn the phase spaces properties. Our approach is either as competitive as or better than most state-of-the-art strategies.
  arXiv  Detail & Related papers  (2020-06-19T21:04:47Z)
• From Checking to Inference: Actual Causality Computations as Optimization Problems [79.87179017975235]
  We present a novel approach to formulate different notions of causal reasoning, over binary acyclic models, as optimization problems. We show that both notions are efficiently automated. Using models with more than $8000$ variables, checking is computed in a matter of seconds, with MaxSAT outperforming ILP in many cases.
  arXiv  Detail & Related papers  (2020-06-05T10:56:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.