Login / Signup
On the Complexity of SHAP-Score-Based Explanations: Tractability via Knowledge Compilation and Non-Approximability Results.
Marcelo Arenas
Pablo Barceló
Leopoldo E. Bertossi
Mikaël Monet
Published in:
J. Mach. Learn. Res. (2023)
Keyphrases
</>
knowledge compilation
product configuration
polynomial size
tractable cases
constraint satisfaction
computational complexity
prime implicates
model counting
worst case
np complete
database
space complexity
normal form
logical inference
database design
data model
database systems