On the complexity of propositional and relational credal networks

Fabio Gagliardi Cozman, Denis Deratani Mauá

Research output: Contribution to conferenceConference Paper

1 Scopus citations

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 languageAmerican English
Pages97-105
Number of pages9
StatePublished - 1 Jan 2015
Externally publishedYes
EventISIPTA 2015 - Proceedings of the 9th International Symposium on Imprecise Probability: Theories and Applications -
Duration: 1 Jan 2015 → …

Conference

ConferenceISIPTA 2015 - Proceedings of the 9th International Symposium on Imprecise Probability: Theories and Applications
Period1/01/15 → …

Fingerprint

Dive into the research topics of 'On the complexity of propositional and relational credal networks'. Together they form a unique fingerprint.

Cite this