DeepAI AI Chat
Log In Sign Up

The Complexity of Bayesian Networks Specified by Propositional and Relational Languages

by   Fabio Gagliardi Cozman, et al.

We examine the complexity of inference in Bayesian networks specified by logical languages. We consider representations that range from fragments of propositional logic to function-free first-order logic with equality; in doing so we cover a variety of plate models and of probabilistic relational models. We study the complexity of inferences when network, query and domain are the input (the inferential and the combined complexity), when the network is fixed and query and domain are the input (the query/data complexity), and when the network and query are fixed and the domain is the input (the domain complexity). We draw connections with probabilistic databases and liftability results, and obtain complexity classes that range from polynomial to exponential levels.


page 1

page 2

page 3

page 4


On the Semantics and Complexity of Probabilistic Logic Programs

We examine the meaning and the complexity of probabilistic logic program...

First-Order Bayesian Network Specifications Capture the Complexity Class PP

The point of this note is to prove that a language is in the complexity ...

Lower Complexity Bounds for Lifted Inference

One of the big challenges in the development of probabilistic relational...

Query the model: precomputations for efficient inference with Bayesian Networks

We consider a setting where a Bayesian network has been built over a rel...

Object-Oriented Bayesian Networks

Bayesian networks provide a modeling language and associated inference a...

Counting Problems over Incomplete Databases

We study the complexity of various fundamental counting problems that ar...