SAT-based rigorous explanations for decision lists
From MaRDI portal
Publication:2118305
Cites work
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
- A SAT-based approach to learn explainable decision sets
- A theory of diagnosis from first principles
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Assessing heuristic machine learning explanations with model counting
- Consistent subsets of inconsistent systems: structure and behaviour
- Enumerating infeasibility: finding multiple MUSes quickly
- Explanation in artificial intelligence: insights from the social sciences
- Fast, flexible MUS enumeration
- Handbook of satisfiability. In 2 parts
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- Improving Glucose for incremental SAT solving with assumptions: application to MUS extraction
- Learning certifiably optimal rule lists for categorical data
- Learning customized and optimized lists of rules with mathematical programming
- MCS Extraction with Sublinear Oracle Queries
- On improving MUS extraction algorithms
- On the reasons behind decisions
- Orange: data mining toolbox in Python
- PySAT: a Python toolkit for prototyping with SAT oracles
- Quantified maximum satisfiability
- RC2: an efficient MaxSAT solver
- Theory and Applications of Satisfiability Testing
- Towards efficient MUS extraction
- WEKA -- experiences with a Java open-source project
Cited in
(14)- A SAT-based approach to learn explainable decision sets
- Learning Optimal Decision Sets and Lists with SAT
- On Tackling Explanation Redundancy in Decision Trees
- Tractability of explaining classifier decisions
- Explaining black-box classifiers: properties and functions
- On computing probabilistic abductive explanations
- Feature necessity \& relevancy in ML classifier explanations
- Towards formal XAI: formally approximate minimal explanations of neural networks
- On the failings of Shapley values for explainability
- Feature necessity and relevancy in machine learning explanations
- A general theoretical framework for learning smallest interpretable models
- Formal explanations of black-box ranking functions
- Towards machine learning as AGM-style belief change
- Towards verified and targeted explanations through formal methods
Describes a project that uses
Uses Software
This page was built for publication: SAT-based rigorous explanations for decision lists
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118305)
