Abstract
© 2015 Proceedings of the 9th International Symposium on Imprecise Probability. A credal network associates a directed acyclic graph with a collection of sets of probability measures. Usually these probability measures are specified through several tables containing probability values. Here we examine the complexity of inference in Boolean credal networks when probability measures are specified through formal languages, by extending a framework we have recently proposed for Bayesian networks. We show that sub-Boolean and relational logics lead to interesting complexity results. In short, we explore the relationship between language and complexity in credal networks.
Original language | American English |
---|---|
Pages | 97-105 |
Number of pages | 9 |
State | Published - 1 Jan 2015 |
Externally published | Yes |
Event | ISIPTA 2015 - Proceedings of the 9th International Symposium on Imprecise Probability: Theories and Applications - Duration: 1 Jan 2015 → … |
Conference
Conference | ISIPTA 2015 - Proceedings of the 9th International Symposium on Imprecise Probability: Theories and Applications |
---|---|
Period | 1/01/15 → … |