Explaining AI decisions using efficient methods for learning sparse Boolean formulae
From MaRDI portal
Publication:2331079
Recommendations
- A SAT-based approach to learn explainable decision sets
- Towards formal XAI: formally approximate minimal explanations of neural networks
- The explanation game: a formal framework for interpretable machine learning
- A unified logical framework for explanations in classifier systems
- Tractability of explaining classifier decisions
Cites work
- A general lower bound on the number of examples needed for learning
- A theory of formal synthesis via inductive learning
- Automatic invariant generation for hybrid systems using ideal fixed points
- Computational limitations on learning from examples
- Constructing invariants for hybrid systems
- Counterexample-guided quantifier instantiation for synthesis in SMT
- Cryptographic limitations on learning Boolean formulae and finite automata
- Explaining AI decisions using efficient methods for learning sparse Boolean formulae
- How to explain individual classification decisions
- scientific article; zbMATH DE number 774007 (Why is no real title available?)
- scientific article; zbMATH DE number 2201583 (Why is no real title available?)
- Learning Boolean formulas
- Most relevant explanation in Bayesian networks
- On PAC learning algorithms for rich Boolean function classes
- Planning Algorithms
- Ranking function synthesis for bit-vector relations
- Sigma*
- The coupon-collector problem revisited — a survey of engineering problems and computational methods
- Theory revision with queries: Horn, read-once, and parity formulas
- When won't membership queries help?
Cited in
(9)- A SAT-based approach to learn explainable decision sets
- Explaining AI decisions using efficient methods for learning sparse Boolean formulae
- Minimal and Complete Explanations for Critical Multi-attribute Decisions
- Explainable deep learning: a field guide for the uninitiated
- White-box induction from SVM models: explainable AI with logic programming
- The explanation game: a formal framework for interpretable machine learning
- Building the hierarchical Choquet integral as an explainable AI classifier via neuroevolution and pruning
- Towards formal XAI: formally approximate minimal explanations of neural networks
- Short Boolean formulas as explanations in practice
This page was built for publication: Explaining AI decisions using efficient methods for learning sparse Boolean formulae
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2331079)
