On the explanatory power of Boolean decision trees
Authors:
- Gilles AudemardGAGilles Audemard
- Steve BellartSBSteve Bellart
- Louenas BouniaLBLouenas Bounia
- Frédéric KoricheFKFrédéric Koriche
- Jean-Marie LagniezJLJean-Marie Lagniez
- Pierre MarquisPMPierre Marquis
- 20 October 2022
- journal article
- research article
- Published by Elsevier in Data & Knowledge Engineering
- Vol. 142
Abstract
No abstract availableKeywords
All Related Versions
This publication has 35 references indexed in Scilit:
- Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form2014
- An empirical evaluation of the comprehensibility of decision table, tree and rule based predictive modelsDecision Support Systems, 2011
- On propositional definabilityArtificial Intelligence, 2008
- Random ForestsMachine Learning, 2001
- Decomposable negation normal formJournal of the ACM, 2001
- A variant of Reiter's hitting-set algorithmInformation Processing Letters, 2001
- On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functionsDiscrete Applied Mathematics, 1999
- A Tight Analysis of the Greedy Algorithm for Set CoverJournal of Algorithms, 1997
- The complexity of logic-based abductionJournal of the ACM, 1995
- A theory of diagnosis from first principlesArtificial Intelligence, 1987