On computing probabilistic abductive explanations
From MaRDI portal
Publication:6116531
DOI10.1016/j.ijar.2023.108939arXiv2212.05990MaRDI QIDQ6116531
Xuanxiang Huang, João P. Marques-Silva, Nina Narodytska, Martin C. Cooper, Yacine Izza, Alexey Ignatiev
Publication date: 18 July 2023
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.05990
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast, flexible MUS enumeration
- Decision tree induction based on efficient tree restructuring
- Bayesian network classifiers
- Minimal sets on propositional formulae. Problems and reductions
- Explanations, belief revision and defeasible reasoning.
- SAT-based rigorous explanations for decision lists
- Non-monotonic explanation functions
- Assessing heuristic machine learning explanations with model counting
- Explanation in artificial intelligence: insights from the social sciences
- Faster FPTASes for counting and random generation of knapsack solutions
- A logic for binary classifiers and their explanation
- On Computing Preferred MUSes and MCSes
- Approximate counting by dynamic programming
- A theory of the learnable
- Graph-Based Algorithms for Boolean Function Manipulation
- On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
- A Faster FPTAS for #Knapsack
- On Tackling Explanation Redundancy in Decision Trees
- Computational Complexity
- Bayesian Reasoning and Machine Learning
- Decomposable negation normal form
- An FPTAS for #Knapsack and Related Counting Problems
- The complexity of theorem-proving procedures
- The Computational Complexity of Understanding Binary Classifier Decisions
- Optimal classification trees
- Consistency restoration and explanations in dynamic CSPs---Application to configuration
This page was built for publication: On computing probabilistic abductive explanations
