Author:
Bertossi Leopoldo,León Jorge E.
Publisher
Springer Nature Switzerland
Reference37 articles.
1. Arenas, M., Barceló, P., Bertossi, L., Monet, M.: On the complexity of SHAP-score-based explanations: tractability via knowledge compilation and non-approximability results. J. Mach. Learn. Res. 24(63), 1–58 (2023). Extended version of [2]
2. Arenas, M., Barceló, P., Bertossi, L., Monet, M.: The tractability of SHAP-score-based explanations for classification over deterministic and decomposable Boolean circuits. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence, pp. 6670–6678 (2021)
3. Audemard, G., Koriche, F., Marquis, P.: On tractable XAI queries based on compiled representations. In: Proceedings KR 2020, pp. 838–849 (2020)
4. Bertossi, L., Li, J., Schleich, M., Suciu, D., Vagena, Z.: Causality-based explanation of classification outcomes. In: Proceedings of the 4th International Workshop on “Data Management for End-to-End Machine Learning” (DEEM) at ACM SIGMOD/PODS, pp. 1–10 (2020). Posted as Corr arXiv Paper arXiv:2003.06868
5. Bertossi, L.: Declarative approaches to counterfactual explanations for classification. Theory Pract. Logic Program. 23(3), 559–593 (2023)