{"total":13,"rows":[{"id":"2103.11251","title":"Interpretable Machine Learning: Fundamental Principles and 10 Grand Challenges","created":"2021-03-20","cited_by_count":367,"area":null},{"id":"2211.00541","title":"Logic-Based Explainability in Machine Learning","created":"2022-10-24","cited_by_count":48,"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":"2406.03059","title":"Efficient Exploration of the Rashomon Set of Rule Set Models","created":"2024-06-05","cited_by_count":10,"area":null},{"id":"2202.03888","title":"Learning MAX-SAT from Contextual Examples for Combinatorial Optimisation","created":"2022-02-08","cited_by_count":8,"area":null},{"id":"2102.01904","title":"A Scalable Two Stage Approach to Computing Optimal Decision Sets","created":"2021-02-03","cited_by_count":7,"area":null},{"id":"2205.06936","title":"Efficient Learning of Interpretable Classification Rules","created":"2022-05-14","cited_by_count":5,"area":null},{"id":"2104.10751","title":"Rule Generation for Classification: Scalability, Interpretability, and Fairness","created":"2021-04-21","cited_by_count":4,"area":null},{"id":"2303.01141","title":"DeepSaDe: Learning Neural Networks that Guarantee Domain Constraint Satisfaction","created":"2023-03-02","cited_by_count":4,"area":null},{"id":"2112.00552","title":"SaDe: Learning Models that Provably Satisfy Domain Constraints","created":"2021-12-01","cited_by_count":3,"area":null},{"id":"2306.03976","title":"Explainable AI using expressive Boolean formulas","created":"2023-06-06","cited_by_count":2,"area":null},{"id":"2501.17493","title":"Certifying Pareto-Optimality in Multi-Objective Maximum Satisfiability","created":"2025-01-29","cited_by_count":2,"area":null},{"id":"2403.16418","title":"An Incremental MaxSAT-based Model to Learn Interpretable and Balanced Classification Rules","created":"2024-03-25","cited_by_count":0,"area":null}],"next_cursor":null}