A SAT-based approach to learn explainable decision sets
From MaRDI portal
Recommendations
- SAT-based rigorous explanations for decision lists
- Explaining AI decisions using efficient methods for learning sparse Boolean formulae
- Learning Optimal Decision Sets and Lists with SAT
- scientific article; zbMATH DE number 7455713
- Tractability of explaining classifier decisions
- Explainable and explorable decision support
- scientific article; zbMATH DE number 2084736
- Symmetric explanation learning: effective dynamic symmetry handling for SAT
- A unified logical framework for explanations in classifier systems
Cited in
(25)- Efficient Learning of Interpretable Classification Rules
- On optimal regression trees to detect critical intervals for multivariate functional data
- Learning Optimal Decision Sets and Lists with SAT
- Explaining AI decisions using efficient methods for learning sparse Boolean formulae
- Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT
- Mathematical optimization in classification and regression trees
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- SAT-based rigorous explanations for decision lists
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games
- Short Boolean formulas as explanations in practice
- Learning optimal decision trees using constraint programming
- Generating explainable rule sets from tree-ensemble learning methods by answer set programming
- Assessing heuristic machine learning explanations with model counting
- Time and space complexity of deterministic and nondeterministic decision trees
- Interpretable machine learning: fundamental principles and 10 grand challenges
- Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group
- Feature necessity \& relevancy in ML classifier explanations
- Optimal multivariate decision trees
- Explainable and explorable decision support
- On Tackling Explanation Redundancy in Decision Trees
- Towards formal XAI: formally approximate minimal explanations of neural networks
- SAT-based optimal classification trees for non-binary data
- scientific article; zbMATH DE number 7625179 (Why is no real title available?)
- Shattering inequalities for learning optimal decision trees
- Minimal and Complete Explanations for Critical Multi-attribute Decisions
This page was built for publication: A SAT-based approach to learn explainable decision sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1799125)
