SAT-based rigorous explanations for decision lists
type: Item
instance of: scholarly article
title: SAT-based rigorous explanations for decision lists
DOI: 10.1007/978-3-030-80223-3_18
author: A. A. Ignatiev
author: Joao Marques-Silva
publication date: 2022-03-22T00:00:00Z
full work available at URL: https://arxiv.org/abs/2105.06782
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R07
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 7495578
describes a project that uses: Glucose
describes a project that uses: shap
describes a project that uses: ORL
describes a project that uses: Orange
describes a project that uses: UCI-ml
describes a project that uses: z3
describes a project that uses: WEKA
describes a project that uses: MaxHS
describes a project that uses: XGBoost
describes a project that uses: PySAT
describes a project that uses: PMLB
describes a project that uses: QUICKXPLAIN
describes a project that uses: RC2
describes a project that uses: GitHub
MaRDI profile type: Publication
OpenAlex ID: W3184339776
cites work: Learning Certifiably Optimal Rule Lists for Categorical Data
cites work: Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction
cites work: Towards efficient MUS extraction
cites work: Q5148371
cites work: Consistent subsets of inconsistent systems: structure and behaviour
cites work: WEKA -- experiences with a Java open-source project
cites work: Q4999271
cites work: Q4411139
cites work: Q2933897
cites work: Quantified maximum satisfiability
cites work: PySAT: a Python toolkit for prototyping with SAT oracles
cites work: RC2: an Efficient MaxSAT Solver
cites work: A SAT-based approach to learn explainable decision sets
cites work: Enumerating Infeasibility: Finding Multiple MUSes Quickly
cites work: A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
cites work: Fast, flexible MUS enumeration
cites work: Theory and Applications of Satisfiability Testing
cites work: Algorithms for computing minimal unsatisfiable subsets of constraints
cites work: On Improving MUS Extraction Algorithms
cites work: MCS Extraction with Sublinear Oracle Queries
cites work: Explanation in artificial intelligence: insights from the social sciences
cites work: Assessing heuristic machine learning explanations with model counting
cites work: A theory of diagnosis from first principles
cites work: Learning customized and optimized lists of rules with mathematical programming
description: scientific article; zbMATH DE number 7495578