Approximating Credal Network Inferences by Linear Programming
From MaRDI portal
Publication:5326407
DOI10.1007/978-3-642-39091-3_2zbMath1390.68629OpenAlexW1667081492MaRDI QIDQ5326407
Cassio Polpo de Campos, Alessandro Antonucci, Marco Zaffalon, David E. Huber
Publication date: 5 August 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://pureadmin.qub.ac.uk/ws/files/17866487/antonucci2013a.pdf
Linear programming (90C05) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items (4)
A Differential Approach for Staged Trees ⋮ A new score for adaptive tests in Bayesian and credal networks ⋮ Thirty years of credal networks: specification, algorithms and complexity ⋮ Decision programming for mixed-integer multi-stage optimization under uncertainty
This page was built for publication: Approximating Credal Network Inferences by Linear Programming
