Foundations of fine-grained explainability
From MaRDI portal
Publication:832283
DOI10.1007/978-3-030-81688-9_24zbMATH Open1493.68209OpenAlexW3185067521MaRDI QIDQ832283FDOQ832283
Authors: S. Hallé, Hugo Tremblay 
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81688-9_24
Recommendations
Data structures (68P05) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)
Cites Work
- Causes and Explanations: A Structural-Model Approach. Part I: Causes
- Model checking of safety properties
- Tools and Algorithms for the Construction and Analysis of Systems
- Complexity results for structure-based causality.
- Whodunit? Causal Analysis for Counterexamples
- Explaining counterexamples using causality
- XML graphs in program analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Declarative layout constraints for testing web applications
- Vacuity in practice: temporal antecedent failure
- The computational complexity of structure-based causality
- Trace diagnostics using temporal implicants
- Monitoring of temporal first-order properties with aggregations
Cited In (7)
- Explicative deep learning with probabilistic formal concepts in a natural language processing task
- Explainable and explorable decision support
- Information lattice learning
- The explanation game: a formal framework for interpretable machine learning
- Logical explanations for deep relational machines using relevance information
- Short Boolean formulas as explanations in practice
- Explaining machine learning models using entropic variable projection
Uses Software
This page was built for publication: Foundations of fine-grained explainability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832283)
