Causal Temporal Reasoning for Markov Decision Processes
Milad Kazemi, Nicola Paoletti

TL;DR
This paper introduces PCFTL, a novel probabilistic temporal logic that incorporates causal reasoning for MDPs, enabling analysis of interventional and counterfactual scenarios in reinforcement learning.
Contribution
It presents the first logic to include causal operators for MDP verification, bridging probabilistic temporal logic with structural causal models for counterfactual reasoning.
Findings
Enables reasoning about 'what-if' scenarios in MDPs
Unified framework for interventional and counterfactual probabilities
Validated on safe reinforcement learning grid-world benchmarks
Abstract
We introduce , a new probabilistic temporal logic for the verification of Markov Decision Processes (MDP). PCFTL is the first to include operators for causal reasoning, allowing us to express interventional and counterfactual queries. Given a path formula , an interventional property is concerned with the satisfaction probability of if we apply a particular change to the MDP (e.g., switching to a different policy); a counterfactual allows us to compute, given an observed MDP path , what the outcome of would have been had we applied in the past. For its ability to reason about \textit{what-if} scenarios involving different configurations of the MDP, our approach represents a departure from existing probabilistic temporal logics that can only reason about a fixed system configuration. From a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Modeling and Causal Inference · Logic, Reasoning, and Knowledge · Semantic Web and Ontologies
