[HTML][HTML] Thirty years of credal networks: Specification, algorithms and complexity

DD Mauá, FG Cozman - International Journal of Approximate Reasoning, 2020 - Elsevier
Credal networks generalize Bayesian networks to allow for imprecision in probability values.
This paper reviews the main results on credal networks under strong independence, as …

[HTML][HTML] Approximate credal network updating by linear programming with applications to decision making

A Antonucci, CP de Campos, D Huber… - International Journal of …, 2015 - Elsevier
Credal nets are probabilistic graphical models which extend Bayesian nets to cope with sets
of distributions. An algorithm for approximate credal network updating is presented. The …

Probabilistic inference in credal networks: new complexity results

DD Mauá, CP de Campos, A Benavoli… - Journal of Artificial …, 2014 - jair.org
Credal networks are graph-based statistical models whose parameters take values in a set,
instead of being sharply specified as in traditional statistical models (eg, Bayesian …

Specifying credal sets with probabilistic answer set programming

DD Mauá, FG Cozman - International Symposium on …, 2023 - proceedings.mlr.press
Abstract Probabilistic Answer Set Programming offers an intuitive and powerful declarative
language to represent uncertainty about combinatorial structures. Remarkably, under the …

[HTML][HTML] Equivalences between maximum a posteriori inference in bayesian networks and maximum expected utility computation in influence diagrams

DD Mauá - International Journal of Approximate Reasoning, 2016 - Elsevier
Two important tasks in probabilistic reasoning are the computation of the maximum posterior
probability of a given subset of the variables in a Bayesian network (MAP), and the …

[HTML][HTML] Distortion models for estimating human error probabilities

PR Alonso-Martín, I Montes, E Miranda - Safety science, 2023 - Elsevier
Abstract Human Reliability Analysis aims at identifying, quantifying and proposing solutions
to human factors causing hazardous consequences. Quantifying the influence of the human …

[HTML][HTML] Fast local search methods for solving limited memory influence diagrams

DD Mauá, FG Cozman - International Journal of Approximate Reasoning, 2016 - Elsevier
Limited memory influence diagrams are graph-based models that describe decision
problems with limited information such as planning with teams and/or agents with imperfect …

Integer programming on the junction tree polytope for influence diagrams

A Parmentier, V Cohen, V Leclère… - INFORMS Journal …, 2020 - pubsonline.informs.org
Influence diagrams (ID) and limited memory influence diagrams (LIMID) are flexible tools to
represent discrete stochastic optimization problems, with the Markov decision process …

[HTML][HTML] On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables

DD Mauá, CP De Campos, M Zaffalon - Artificial Intelligence, 2013 - Elsevier
Influence diagrams are intuitive and concise representations of structured decision
problems. When the problem is non-Markovian, an optimal strategy can be exponentially …

Complexity of inferences in polytree-shaped semi-qualitative probabilistic networks

C de Campos, F Cozman - Proceedings of the AAAI Conference on …, 2013 - ojs.aaai.org
Semi-qualitative probabilistic networks (SQPNs) merge two important graphical model
formalisms: Bayesian networks and qualitative probabilistic networks. They provide a very …