Solving Hard XAI Queries Based on a Compiled Dual-Rail Encoding
It is proved in this paper that several classes of abductive explanations, remain hard to compute even for Ordered Binary Decision Diagrams, one of the most tractable subsets of the knowledge compilation map.
Arthur Ledaguenel, Florent Capelli, Jean-Marie Lagniez
· 0 citations