Sufficient Reasons and Explanations for Reactive Systems
Hadar Frenkel, Nadav Rutman Moshe
Abstract
We address the problem of temporal causality and explainability for reactive systems, and, in this setting, study sufficient reasons and contrastive explanations. These two notions are well-known explainability measures in the context of neural networks. In this work, we unify these notions for reactive systems and formal specifications given in temporal logic, providing dedicated definitions for sufficient reasons and contrastive explanations. We then lift these definitions to temporal sufficient reasons and contrastive explanations, providing more general and symbolic representations of explainability. We analyze the complexity of both verifying and finding explanations of the different types, and we demonstrate our approach using a prototype implementation.
Create a lesson
Related papers
Integer reachability in VASS with transfers: a refined complexity analysis
Tymoteusz Kucharek, Piotr Hofman
Finite-ring obstructions for quadratic binary radius-two cellular automata
Houqiao Fu
Observer--Fragmentation--Exposure Tradeoffs: From Rectangular CFG Exposure to Ordered MCFG Scheduling
Takayuki Kuriyama
The Ultimate Fate of Life Is Not Shared
Ziyue Gan, Ziran Li, Jiadong Zhu
Learning Shuffle Ideals with Membership Queries and Contrastive Examples
S. Mahmoud Mousawi, Pierluigi San Pietro, Sandra Zilles
Quadratic bounds for uncompletable words and matrix mortality
Rahul Chandelkar, Samrath Singh Chadha