Anytime approximate formal feature attribution

DOI10.4230/LIPICS.SAT.2024.30MaRDI QIDQ6864407zbMATH OpenFDO

Authors Jinqiang Yu, Graham Farr, A. A. Ignatiev, Peter J. Stuckey

Publication date 3 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SAT.2024.30

zbMATH Keywords

explainable AIformal feature attributionminimal unsatisfiable subsetsMUS enumeration

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites work

• A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
• A NEW MEASURE OF RANK CORRELATION
• A theory of diagnosis from first principles
• Algorithms for computing minimal unsatisfiable subsets of constraints
• Algorithms for implicit hitting set problems
• Consistent subsets of inconsistent systems: structure and behaviour
• Constructing optimal binary decision trees is NP-complete
• Enumerating infeasibility: finding multiple MUSes quickly
• Explanation in artificial intelligence: insights from the social sciences
• Fast, flexible MUS enumeration
• Feature necessity \& relevancy in ML classifier explanations
• Greedy function approximation: A gradient boosting machine.
• Handbook of satisfiability. In 2 parts
• MCS Extraction with Sublinear Oracle Queries
• On Information and Sufficiency
• Quantified maximum satisfiability
• Recursive online enumeration of all minimal unsatisfiable subsets
• The complexity of computing the permanent
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• The complexity of counting in sparse, regular, and planar graphs
• Theory and Applications of Satisfiability Testing
• Towards efficient MUS extraction

This page was built for publication: Anytime approximate formal feature attribution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6864407)