Assessing Heuristic Machine Learning Explanations with Model Counting
- 29 June 2019
- book chapter
- Published by Springer Nature
- p. 267-278
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- XGBoost2016
- “Why Should I Trust You?”: Explaining the Predictions of Any Classifier2016
- On computing minimal independent support and its applications to sampling and countingConstraints, 2015
- Dsharp: Fast d-DNNF Compilation with sharpSAT2012
- Extending SAT Solvers to Cryptographic Problems2009
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints2005
- An Optimal Algorithm for Monte Carlo EstimationSIAM Journal on Computing, 2000
- PP is as Hard as the Polynomial-Time HierarchySIAM Journal on Computing, 1991
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979
- Universal classes of hash functions (Extended Abstract)1977