The descriptive complexity of Bayesian network specifications

DOI10.1007/978-3-319-61581-3_9MaRDI QIDQ2401860zbMATH OpenOpenAlexWikidataFDO

Authors Fabio G. Cozman, D. D. Maua

Publication date 5 September 2017

Full work available at URL https://doi.org/10.1007/978-3-319-61581-3_9

Mathematics Subject Classification ID

Probabilistic graphical models (62H22) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Specification and verification (program logics, model checking, etc.) (68Q60) Descriptive complexity and finite models (68Q19)

Recommendations

• The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws
• The complexity of Bayesian networks specified by propositional and relational languages
• The effect of combination functions on the complexity of relational Bayesian networks
• On the complexity of propositional and relational credal networks
• Tight complexity bounds for reasoning in the description logic \(\mathcal{BEL}\)

Cited in

(1)

• The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws

This page was built for publication: The descriptive complexity of Bayesian network specifications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2401860)