Probabilistic Inference in Credal Networks: New Complexity Results

DOI10.1613/jair.4355zbMath1366.68329OpenAlexW2134922236WikidataQ57673162 ScholiaQ57673162MaRDI QIDQ5494858

Cassio Polpo de Campos, Alessandro Antonucci, Denis Deratani Mauá, Alessio Benavoli

Publication date: 30 July 2014

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.4355

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Reasoning under uncertainty in the context of artificial intelligence (68T37) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Bayesian nonparametric system reliability using sets of priors ⋮ Cautious classification with data missing not at random using generative random forests ⋮ A new score for adaptive tests in Bayesian and credal networks ⋮ Credal networks under epistemic irrelevance ⋮ Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams ⋮ Modelling epistemic irrelevance with choice functions ⋮ Thirty years of credal networks: specification, algorithms and complexity ⋮ Robustifying sum-product networks ⋮ Unifying parameter learning and modelling complex systems with epistemic uncertainty using probability interval ⋮ Approximate credal network updating by linear programming with applications to decision making