scientific article; zbMATH DE number 2014741
From MaRDI portal
Publication:4438020
Recommendations
- Credal networks
- Thirty years of credal networks: specification, algorithms and complexity
- Inference in credal networks: Branch-and-bound methods and the A/R+ algorithm
- Decision-theoretic specification of credal networks: a unified language for uncertain modeling with sets of Bayesian networks
- Updating credal networks is approximable in polynomial time
Cited in
(8)- Credal networks under epistemic irrelevance
- Imprecise continuous-time Markov chains
- Discrete time Markov chains with interval probabilities
- Unifying parameter learning and modelling complex systems with epistemic uncertainty using probability interval
- Decision-theoretic specification of credal networks: a unified language for uncertain modeling with sets of Bayesian networks
- Evidential Networks from a Different Perspective
- On the complexity of propositional and relational credal networks
- Exploiting Bayesian network sensitivity functions for inference in credal networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4438020)