{"total":31,"rows":[{"id":"2211.00541","title":"Logic-Based Explainability in Machine Learning","created":"2022-10-24","cited_by_count":48,"area":null},{"id":"2205.09971","title":"On Tackling Explanation Redundancy in Decision Trees","created":"2022-05-20","cited_by_count":44,"area":null},{"id":"2207.12213","title":"On Computing Probabilistic Explanations for Decision Trees","created":"2022-06-30","cited_by_count":35,"area":null},{"id":"2212.08507","title":"Robust Explanation Constraints for Neural Networks","created":"2022-12-16","cited_by_count":24,"area":null},{"id":"2206.09551","title":"Eliminating The Impossible, Whatever Remains Must Be True","created":"2022-06-20","cited_by_count":23,"area":null},{"id":"2210.15675","title":"Feature Necessity & Relevancy in ML Classifier Explanations","created":"2022-10-27","cited_by_count":23,"area":null},{"id":"2406.02981","title":"Local vs. Global Interpretability: A Computational Complexity Perspective","created":"2024-06-05","cited_by_count":23,"area":null},{"id":"2307.05902","title":"Stability Guarantees for Feature Attributions with Multiplicative Smoothing","created":"2023-07-12","cited_by_count":14,"area":null},{"id":"2306.01744","title":"Disproving XAI Myths with Formal Methods -- Initial Results","created":"2023-05-13","cited_by_count":12,"area":null},{"id":"2502.03391","title":"Explain Yourself, Briefly! Self-Explaining Neural Networks with Concise Sufficient Reasons","created":"2025-02-05","cited_by_count":12,"area":null},{"id":"2307.03380","title":"On Formal Feature Attribution and Its Approximation","created":"2023-07-07","cited_by_count":11,"area":null},{"id":"2205.08452","title":"A Psychological Theory of Explainability","created":"2022-05-17","cited_by_count":10,"area":null},{"id":"2501.06078","title":"Explaining k-Nearest Neighbors: Abductive and Counterfactual Explanations","created":"2025-01-10","cited_by_count":10,"area":null},{"id":"2206.00759","title":"Interpretability Guarantees with Merlin-Arthur Classifiers","created":"2022-06-01","cited_by_count":9,"area":null},{"id":"2312.06973","title":"Anytime Approximate Formal Feature Attribution","created":"2023-12-12","cited_by_count":9,"area":null},{"id":"2504.13787","title":"Probabilistic Stability Guarantees for Feature Attributions","created":"2025-04-18","cited_by_count":9,"area":null},{"id":"2205.09569","title":"Provably Precise, Succinct and Efficient Explanations for Decision Trees","created":"2022-05-19","cited_by_count":8,"area":null},{"id":"2205.09901","title":"Cardinality-Minimal Explanations for Monotonic Neural Networks","created":"2022-05-19","cited_by_count":8,"area":null},{"id":"2510.21599","title":"SHAP Meets Tensor Networks: Provably Tractable Explanations with Parallelism","created":"2025-10-24","cited_by_count":8,"area":null},{"id":"2207.07072","title":"A Query-Optimal Algorithm for Finding Counterfactuals","created":"2022-07-14","cited_by_count":7,"area":null},{"id":"2406.10529","title":"A Theory of Interpretable Approximations","created":"2024-06-15","cited_by_count":7,"area":null},{"id":"2605.11161","title":"Interpretability Can Be Actionable","created":"2026-05-11","cited_by_count":7,"area":null},{"id":"2207.04748","title":"On Computing Relevant Features for Explaining NBCs","created":"2022-07-11","cited_by_count":5,"area":null},{"id":"2510.21292","title":"Additive Models Explained: A Computational Complexity Approach","created":"2025-10-24","cited_by_count":3,"area":null},{"id":"2202.07553","title":"On Deciding Feature Membership in Explanations of SDD & Related Classifiers","created":"2022-02-15","cited_by_count":2,"area":null},{"id":"2411.08478","title":"Learning Model Agnostic Explanations via Constraint Programming","created":"2024-11-13","cited_by_count":2,"area":null},{"id":"2602.18160","title":"Unifying Formal Explanations: A Complexity-Theoretic Perspective","created":"2026-02-20","cited_by_count":2,"area":null},{"id":"2202.11593","title":"Finding Safe Zones of policies Markov Decision Processes","created":"2022-02-23","cited_by_count":1,"area":null},{"id":"2312.07103","title":"The Computational Complexity of Concise Hypersphere Classification","created":"2023-12-12","cited_by_count":1,"area":null},{"id":"2602.17530","title":"Provably Explaining Neural Additive Models","created":"2026-02-19","cited_by_count":1,"area":null},{"id":"2609.19077","title":"Probabilistic Linear Explanations","created":"2026-09-16","cited_by_count":0,"area":null}],"next_cursor":null}