{"type":"ScholarlyArticle","title":"The Inferential Complexity of Bayesian and Credal Networks","authors":[{"name":"Cassio Polpo de Campos","slug":"cassio-polpo-de-campos","given":"Cassio Polpo","family":"de Campos","affiliation":""},{"name":"Fábio Gagliardi Cozman","slug":"fabio-gagliardi-cozman","given":"Fabio Gagliardi","family":"Cozman","affiliation":""}],"abstract":"This paper presents new results on the complexity of graph-theoretical models that represent probabilities (Bayesian networks) and that represent interval and set valued probabilities (credal networks). We define a new class of networks with bounded width, and introduce a new decision problem for Bayesian networks, the maximin a posteriori. We present new links between the Bayesian and credal networks, and present new results both for Bayesian networks (most probable explanation with observations, maximin a posteriori) and for credal networks (bounds on probabilities a posteriori, most probable explanation with and without observations, maximum a posteriori).","doi":null,"url":"https://ijcai.org/proceedings/2005/92","pdf":"https://ijcai.org/proceedings/2005/0092.pdf","markdown":"https://ijcai.org/proceedings/2005/92.md","bibtex":"https://ijcai.org/proceedings/2005/bibtex/92","volume":{"slug":"2005","title":"Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2005","url":"https://ijcai.org/proceedings/2005/","year":2005,"location":"Edinburgh, Scotland, UK","dates":"","editors":"","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":92,"pages":{"first":1313,"last":1317},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}