This work completes the study [1]} that focuses on designing tractable cases for a superset of the 9 XAI queries considered here, using
knowledge compilation techniques. The fact that each of the 9 XAI queries is intractable (NP-hard) when the Boolean classifier \(\rho \)  under consideration
is unconstrained justifies the need to look for specific representations of circuits
into languages ensuring the tractability of those queries and for translation (“knowledge compilation”) techniques for turning
classifiers into representations from such tractable languages, as it has been done in [1]}.
