Explaining multivariate decision trees: characterising tractable languages

DOI10.1613/JAIR.1.21423MaRDI QIDQ7307262zbMATH OpenFDO

Authors Clément Carbonnel, M. C. Cooper, Emmanuel Hebrard, Dany Morales, Joao Marques-Silva

Publication date 31 July 2026

Published in The Journal of Artificial Intelligence Research (JAIR) (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1613/JAIR.1.21423

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05) Natural language processing (68T50)

Cites work

• A dichotomy theorem for nonuniform CSPs
• Characterising tractable constraints
• Closure properties of constraints
• Constraints, consistency and closure
• Explanation in artificial intelligence: insights from the social sciences
• Frontiers of Combining Systems
• HHCART: an oblique decision tree
• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 1149432 (Why is no real title available?)
• Multivariate decision trees
• On Tackling Explanation Redundancy in Decision Trees
• On the Optimality of Some Set Algorithms
• The complexity of satisfiability problems
• The complexity of selecting maximal solutions
• The computational complexity of understanding binary classifier decisions
• Tractability in constraint satisfaction problems: a survey
• Tractability of explaining classifier decisions
• Tractable constraints on ordered domains

This page was built for publication: Explaining multivariate decision trees: characterising tractable languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307262)