Bayesian networks specified using propositional and relational constructs: Combined, data, and domain complexity

Fabio Gagliardi Cozman, Denis Deratani Mauá

Research output: Contribution to conferenceConference Paper

13 Scopus citations

Abstract

© Copyright 2015, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved. 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.
Original languageAmerican English
Pages3519-3525
Number of pages7
StatePublished - 1 Jun 2015
Externally publishedYes
EventProceedings of the National Conference on Artificial Intelligence -
Duration: 1 Jun 2015 → …

Conference

ConferenceProceedings of the National Conference on Artificial Intelligence
Period1/06/15 → …

Fingerprint

Dive into the research topics of 'Bayesian networks specified using propositional and relational constructs: Combined, data, and domain complexity'. Together they form a unique fingerprint.

Cite this