Johan Kwisthout

Available identifiers

Publication	Date of Publication	Type
Motivating explanations in Bayesian networks using MAP-independence	2023-01-06	Paper
Explainable AI using MAP-independence	2022-06-15	Paper
Approximate inference in Bayesian networks: parameterized complexity results	2019-02-20	Paper
Rational analysis, intractability, and the prospects of `as if'-explanations	2018-03-27	Paper
Tree-Width and the Computational Complexity of MAP Approximations in Bayesian Networks	2015-08-25	Paper
Most frugal explanations in Bayesian networks	2015-02-02	Paper
Treewidth and the Computational Complexity of MAP Approximations	2015-01-14	Paper
Minimizing Relative Entropy in Hierarchical Predictive Coding	2015-01-14	Paper
A computational-level explanation of the speed of goal inference	2014-03-03	Paper
Most Inforbable Explanations: Finding Explanations in Bayesian Networks That Are Both Probable and Informative	2013-08-05	Paper
Structure Approximation of Most Probable Explanations in Bayesian Networks	2013-08-05	Paper
Most probable explanations in Bayesian networks: complexity and tractability	2012-07-05	Paper
The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks	2011-05-11	Paper
The Complexity of Finding kth Most Probable Explanations in Probabilistic Networks	2011-02-15	Paper
Complexity results for enhanced qualitative probabilistic networks	2010-03-18	Paper
Local Monotonicity in Probabilistic Networks	2008-09-16	Paper
The Computational Complexity of Monotonicity in Probabilistic Networks	2008-02-26	Paper

This page was built for person: Johan Kwisthout