@inproceedings{cozman2015aaai,
 abstract = {We examine the inferential complexity of Bayesian
networks specified through logical constructs. We first
consider simple propositional languages, and then move
to relational languages. We examine both the combined
complexity of inference (as network size and evidence
size are not bounded) and the data complexity of
inference (where network size is bounded); we also
examine the connection to liftability through domain
complexity. Combined and data complexity of several
inference problems are presented, ranging from
polynomial to exponential classes.},
 author = {Fabio Gagliardi Cozman and Denis Deratani Mauá},
 booktitle = {Proceedings of the Twenty-Ninth AAAI Conference on
Artificial Intelligence},
 pages = {3519--3525},
 selected = {1},
 title = {Bayesian Networks Specified Using Propositional and
Relational Constructs: Combined, Data, and Domain
Complexity},
 url = {http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9312/9787},
 year = {2015}
}