Tractable Explanations for d-DNNF Classifiers

Compilation into propositional languages finds a growing number of practical uses, including in constraint programming, diagnosis and machine learning (ML), among others. One concrete example is the use of propositional languages as classifiers, and one natural question is how to explain the predictions made. This paper shows that for classifiers represented with some of the best-known propositional languages, different kinds of explanations can be computed in polynomial time. These languages include deterministic decomposable negation normal form (d-DNNF), and so any propositional language that is strictly less succinct than d-DNNF. Furthermore, the paper describes optimizations, specific to Sentential Decision Diagrams (SDDs), which are shown to yield more efficient algorithms in practice.

Authors

• Xuanxiang Huang CNRS@CREATE
• Yacine Izza National University of Singapore
• Alexey Ignatiev Monash University
• Martin Cooper UPS – IRIT
• Nicholas Asher
• Joao Marques-Silva ICREA, Universitat de Lleida

Keywords

No keywords are indexed for this paper.