Fetching the paper…
Reading the bibliography…
Decision lists are one of the most easily explainable machine learning models.
Sorting Networks and Their Applications
Batcher, K. E. 1968 · 1968
Earlier work this paper cites.
On the Complexity of Derivation in Propositional Calculus
Tseitin, G. S. 1968 · 1968
Earlier work this paper cites.
Learning Decision Lists
Rivest, R. L. 1987 · 1987
Earlier work this paper cites.
The CN2 Induction Algorithm
Clark, P.; and Niblett, T. 1989 · 1989
Earlier work this paper cites.
Rule Induction with CN2: Some Recent Improvements
Clark, P.; and Boswell, R. 1991 · 1991
Earlier work this paper cites.
Mining Association Rules between Sets of Items in Large Databases
Agrawal, R.; Imieliński, T.; and Swami, A. 1993 · 1993
Earlier work this paper cites.
Efficient CNF Encoding of Boolean Cardinality Constraints
Bailleux, O.; and Boufkhad, Y. 2003 · 2003
Earlier work this paper cites.
Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
Sinz, C. 2005 · 2005
Earlier work this paper cites.
Computing Optimal Decision Sets with SAT
Yu, J.; Ignatiev, A.; Stuckey, P. J.; and Le Bodic, P. 2020 · 2007
Earlier work this paper cites.
Cardinality Networks and Their Applications
Asín, R.; Nieuwenhuis, R.; Oliveras, A.; and Rodríguez-Carbonell, E. 2009 · 2009
Cited alongside, same era.
Handbook of Satisfiability . IOS Press
Biere, A.; Heule, M.; van Maaren, H.; and Walsh, T., eds. 2009 · 2009
Cited alongside, same era.
Scikit-learn: Machine Learning in Python
Pedregosa, F.; Varoquaux, G.; Gramfort, A.; Michel, V.; Thirion, B.; Grisel, O.; Blondel, M.; Prettenhofer, P.; Weiss, R.; Dubourg, V.; Vanderplas, J.; Passos, A.; Cournapeau, D.; Brucher, M.; Perrot, M.; and Duchesnay, E. 2011 · 2011
Cited alongside, same era.
Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction
Audemard, G.; Lagniez, J.; and Simon, L. 2013 · 2013
Cited alongside, same era.
StarExec: A Cross-Community Infrastructure for Logic Solving
Stump, A.; Sutcliffe, G.; and Tinelli, C. 2014 · 2014
Cited alongside, same era.
Learning Certifiably Optimal Rule Lists
Angelino, E.; Larus-Stone, N.; Alabi, D.; Seltzer, M.; and Rudin, C. 2017 · 2017
A SAT-Based Approach to Learn Explainable Decision Sets
Ignatiev, A.; Pereira, F.; Narodytska, N.; and Marques-Silva, J. 2018 · 2018
Later among the works it cites.
Learning Optimal Decision Trees with SAT
Narodytska, N.; Ignatiev, A.; Pereira, F.; and Marques-Silva, J. 2018 · 2018
Later among the works it cites.
Learning customized and optimized lists of rules with mathematical programming
Rudin, C.; and Ertekin, S. 2018 · 2018
Later among the works it cites.
Optimal sparse decision trees
Hu, X.; Rudin, C.; and Seltzer, M. 2019 · 2019
Later among the works it cites.
RC2: an Efficient MaxSAT Solver
Ignatiev, A.; Morgado, A.; and Marques-Silva, J. 2019 · 2019
Later among the works it cites.
Learning optimal decision trees using constraint programming
Verhaeghe, H.; Nijssen, S.; Pesant, G.; Quimper, C.-G.; and Schaus, P. 2019 · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A Bayesian Framework for Learning Rule Sets for Interpretable Classification
Wang, T.; Rudin, C.; Doshi-Velez, F.; Liu, Y.; Klampfl, E.; and MacNeille, P. 2017 · 2017
Cited alongside, same era.
Learning Certifiably Optimal Rule Lists for Categorical Data
Angelino, E.; Larus-Stone, N.; Alabi, D.; Seltzer, M.; and Rudin, C. 2018 · 2018
Cited alongside, same era.
PySAT: A Python Toolkit for Prototyping with SAT Oracles
Ignatiev, A.; Morgado, A.; and Marques-Silva, J. 2018 · 2018
Cited alongside, same era.
Learning Optimal Decision Trees Using Caching Branch-and-Bound Search
Aglin, G.; Nijssen, S.; and Schaus, P. 2020 · 2020
Closest in time.
Penn Machine Learning Benchmarks
PennML. 2020 · 2020
Closest in time.
UCI Machine Learning Repository
UCI. 2020 · 2020
Closest in time.