ASTERYX : A model-Agnostic SaT-basEd appRoach for sYmbolic and score-based eXplanations
Not on the map. Why?
Abstract (arXiv)
The ever increasing complexity of machine learning techniques used more and more in practice, gives rise to the need to explain the predictions and decisions of these models, often used as black-boxes. Explainable AI approaches are either numerical feature-based aiming to quantify the contribution of each feature in a prediction or symbolic providing certain forms of symbolic explanations such as counterfactuals. This paper proposes a generic agnostic approach named ASTERYX allowing to generate both symbolic explanations and score-based ones. Our approach is declarative and it is based on the encoding of the model to be explained in an equivalent symbolic representation, this latter serves to generate in particular two types of symbolic explanations which are sufficient reasons and counterfactuals. We then associate scores reflecting the relevance of the explanations and the features w.r.t to some properties. Our experimental results show the feasibility of the proposed approach and its effectiveness in providing symbolic and score-based explanations.
Key facts. Cited by 26 papers in the map (data through 7 Oct 2026). Builds on 13 of its 32 references that are in the map. First posted on arXiv 23 Jun 2022.
Builds on
13 of 32 references.
References · 13
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
- 2018Abduction-Based Explanations for Machine Learning Modelscited by 159
- 2018A Symbolic Approach to Explaining Bayesian Network Classifierscited by 130
- 2017Verifying Properties of Binarized Deep Neural Networkscited by 77
- 2020On Explaining Decision Treescited by 49
- 2021SAT-Based Rigorous Explanations for Decision Listscited by 40
- 2020On Tractable Representations of Binary Neural Networkscited by 34
- 2020Three Modern Roles for Logic in AIcited by 15
- 2020On Relating 'Why?' and 'Why Not?' Explanationscited by 15
- 2020Declarative Approaches to Counterfactual Explanations for Classificationcited by 14
- 2022A Symbolic Approach for Counterfactual Explanationscited by 5
1 more
Built on by
Citing papers per year: 2022: 5; 2023: 8; 2024: 5; 2025: 4; 2026: 4.
26 papers.
Sort:
- 2022Logic-Based Explainability in Machine Learningcited by 47
- 2022VeriX: Towards Verified Explainability of Deep Neural Networkscited by 30
- 2023The Inadequacy of Shapley Values for Explainabilitycited by 30
- 2024Local vs. Global Interpretability: A Computational Complexity Perspectivecited by 23
- 2022Feature Necessity & Relevancy in ML Classifier Explanationscited by 22
- 2022On Computing Probabilistic Abductive Explanationscited by 18
- 2023Delivering Inflated Explanationscited by 16
- 2025Explaining, Fast and Slow: Abstraction and Refinement of Provable Explanationscited by 13
- 2023HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baselinecited by 12
- 2023Disproving XAI Myths with Formal Methods -- Initial Resultscited by 12
- 2023On Formal Feature Attribution and Its Approximationcited by 11
- 2024Hard to Explain: On the Computational Hardness of In-Distribution Model Interpretationcited by 11
14 more
- 2025Explain Yourself, Briefly! Self-Explaining Neural Networks with Concise Sufficient Reasonscited by 11
- 2026Formal Mechanistic Interpretability: Automated Circuit Discovery with Provable Guaranteescited by 10
- 2023A New Class of Explanations for Classifiers with Non-Binary Featurescited by 8
- 2022On Computing Relevant Features for Explaining NBCscited by 5
- 2024Axiomatic Characterisations of Sample-based Explainerscited by 3
- 2026FAME: Formal Abstract Minimal Explanation for Neural Networkscited by 3
- 2024Logic-Based Explainability: Past, Present & Futurecited by 2
- 2023Finding Minimum-Cost Explanations for Predictions made by Tree Ensemblescited by 1
- 2024Automated Explanation Selection for Scientific Discoverycited by 1
- 2025Uncovering Bugs in Formal Explainers: A Case Study with PyXAIcited by 1
- 2026Provably Explaining Neural Additive Modelscited by 1
- 2026Unifying Formal Explanations: A Complexity-Theoretic Perspectivecited by 1
- 2023On Logic-Based Explainability with Partially Specified Inputscited by 0
- 2025Efficient & Correct Predictive Equivalence for Decision Treescited by 0
- 2026FAME: Formal Abstract Minimal Explanation for Neural Networks11 Mar 2026
- 2026Unifying Formal Explanations: A Complexity-Theoretic Perspective20 Feb 2026
- 2026Provably Explaining Neural Additive Models19 Feb 2026
- 2026Formal Mechanistic Interpretability: Automated Circuit Discovery with Provable Guarantees18 Feb 2026
- 2025Uncovering Bugs in Formal Explainers: A Case Study with PyXAI5 Nov 2025
- 2025Efficient & Correct Predictive Equivalence for Decision Trees22 Sep 2025
- 2025Explaining, Fast and Slow: Abstraction and Refinement of Provable Explanations10 Jun 2025
- 2025Explain Yourself, Briefly! Self-Explaining Neural Networks with Concise Sufficient Reasons5 Feb 2025
- 2024Axiomatic Characterisations of Sample-based Explainers9 Aug 2024
- 2024Hard to Explain: On the Computational Hardness of In-Distribution Model Interpretation7 Aug 2024
- 2024Automated Explanation Selection for Scientific Discovery24 Jul 2024
- 2024Local vs. Global Interpretability: A Computational Complexity Perspective5 Jun 2024
14 more
- 2024Logic-Based Explainability: Past, Present & Future4 Jun 2024
- 2023On Formal Feature Attribution and Its Approximation7 Jul 2023
- 2023On Logic-Based Explainability with Partially Specified Inputs27 Jun 2023
- 2023Delivering Inflated Explanations27 Jun 2023
- 2023Disproving XAI Myths with Formal Methods -- Initial Results13 May 2023
- 2023A New Class of Explanations for Classifiers with Non-Binary Features28 Apr 2023
- 2023Finding Minimum-Cost Explanations for Predictions made by Tree Ensembles16 Mar 2023
- 2023The Inadequacy of Shapley Values for Explainability16 Feb 2023
- 2023HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline4 Feb 2023
- 2022On Computing Probabilistic Abductive Explanations12 Dec 2022
- 2022VeriX: Towards Verified Explainability of Deep Neural Networks2 Dec 2022
- 2022Feature Necessity & Relevancy in ML Classifier Explanations27 Oct 2022
- 2022Logic-Based Explainability in Machine Learning24 Oct 2022
- 2022On Computing Relevant Features for Explaining NBCs11 Jul 2022
- 2022Logic-Based Explainability in Machine Learningcited by 47
- 2022VeriX: Towards Verified Explainability of Deep Neural Networkscited by 30
- 2023The Inadequacy of Shapley Values for Explainabilitycited by 30
- 2024Local vs. Global Interpretability: A Computational Complexity Perspectivecited by 23
- 2022Feature Necessity & Relevancy in ML Classifier Explanationscited by 22
- 2022On Computing Probabilistic Abductive Explanationscited by 18
- 2023Delivering Inflated Explanationscited by 16
- 2025Explaining, Fast and Slow: Abstraction and Refinement of Provable Explanationscited by 13
- 2023HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baselinecited by 12
- 2023Disproving XAI Myths with Formal Methods -- Initial Resultscited by 12
- 2023On Formal Feature Attribution and Its Approximationcited by 11
- 2024Hard to Explain: On the Computational Hardness of In-Distribution Model Interpretationcited by 11
12 most cited of 26 All 26 (JSON)
- 2026FAME: Formal Abstract Minimal Explanation for Neural Networks11 Mar 2026
- 2026Unifying Formal Explanations: A Complexity-Theoretic Perspective20 Feb 2026
- 2026Provably Explaining Neural Additive Models19 Feb 2026
- 2026Formal Mechanistic Interpretability: Automated Circuit Discovery with Provable Guarantees18 Feb 2026
- 2025Uncovering Bugs in Formal Explainers: A Case Study with PyXAI5 Nov 2025
- 2025Efficient & Correct Predictive Equivalence for Decision Trees22 Sep 2025
- 2025Explaining, Fast and Slow: Abstraction and Refinement of Provable Explanations10 Jun 2025
- 2025Explain Yourself, Briefly! Self-Explaining Neural Networks with Concise Sufficient Reasons5 Feb 2025
- 2024Axiomatic Characterisations of Sample-based Explainers9 Aug 2024
- 2024Hard to Explain: On the Computational Hardness of In-Distribution Model Interpretation7 Aug 2024
- 2024Automated Explanation Selection for Scientific Discovery24 Jul 2024
- 2024Local vs. Global Interpretability: A Computational Complexity Perspective5 Jun 2024
12 newest of 26 All 26 (JSON)