SAT-based encodings for optimal decision trees with explicit paths

DOI10.1007/978-3-030-51825-7_35OpenAlexW3038592001MaRDI QIDQ2661377

Mikoláš Janota, Antonio Morgado

Publication date: 7 April 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-51825-7_35

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)

Related Items (6)

On Tackling Explanation Redundancy in Decision Trees ⋮ Efficient Learning of Interpretable Classification Rules ⋮ Shattering inequalities for learning optimal decision trees ⋮ SAT-based optimal classification trees for non-binary data ⋮ Unnamed Item ⋮ Learning Optimal Decision Sets and Lists with SAT

This page was built for publication: SAT-based encodings for optimal decision trees with explicit paths