Learning Optimal Decision Sets and Lists with SAT
From MaRDI portal
Recommendations
- Learning MAX-SAT from contextual examples for combinatorial optimisation
- A SAT-based approach to learn explainable decision sets
- SAT-based rigorous explanations for decision lists
- An efficient SAT formulation for learning multiple criteria non-compensatory sorting rules from examples
- Learning non-compensatory sorting models using efficient SAT/MaxSAT formulations
- Learning optimal decision trees using constraint programming
- Incorporating Learning in Grid-Based Randomized SAT Solving
- Formal Methods for Hardware Verification
Cites work
- A Bayesian framework for learning rule sets for interpretable classification
- A continuous approach to inductive inference
- A SAT-based approach to learn explainable decision sets
- Branch-and-price: Column generation for solving huge integer programs
- Cardinality Networks and Their Applications
- Data mining. Concepts and techniques
- Efficient CNF encoding of Boolean cardinality constraints
- Explanation in artificial intelligence: insights from the social sciences
- Foundations of Rule Learning
- How to explain individual classification decisions
- scientific article; zbMATH DE number 1179314 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- scientific article; zbMATH DE number 3313427 (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
- Learning explanatory rules from noisy data
- Learning optimal decision trees using constraint programming
- Lower bounds on learning decision lists and trees
- Machine learning: Trends, perspectives, and prospects
- On the reasons behind decisions
- PySAT: a Python toolkit for prototyping with SAT oracles
- RC2: an efficient MaxSAT solver
- SAT-based encodings for optimal decision trees with explicit paths
- Scikit-learn: machine learning in Python
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
Cited in
(10)- Learning certifiably optimal rule lists for categorical data
- A SAT-based approach to learn explainable decision sets
- Interpretable machine learning: fundamental principles and 10 grand challenges
- scientific article; zbMATH DE number 1950768 (Why is no real title available?)
- On Tackling Explanation Redundancy in Decision Trees
- Efficient Learning of Interpretable Classification Rules
- SAT-based optimal classification trees for non-binary data
- On optimal regression trees to detect critical intervals for multivariate functional data
- A general theoretical framework for learning smallest interpretable models
- Interpretable optimisation-based approach for hyper-box classification
This page was built for publication: Learning Optimal Decision Sets and Lists with SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5026234)
