Multiplicative-Additive Proof Equivalence is Logspace-complete, via Binary Decision Trees.
Marc BagnolPublished in: CoRR (2017)
Keyphrases
- decision trees
- decision tree induction
- rule induction
- theorem proving
- machine learning
- multi valued
- predictive accuracy
- training data
- naive bayes
- machine learning algorithms
- decision rules
- neural network
- provably correct
- logic programs
- ensemble methods
- random forest
- computational complexity
- knowledge base
- binary classification problems
- decision tree learning