The effect of combination functions on the complexity of relational Bayesian networks

DOI10.1016/J.IJAR.2017.03.014MaRDI QIDQ2409113zbMATH OpenOpenAlexDBLPWikidataFDO

Authors D. D. Maua, Fabio Gagliardi Cozman

Publication date 11 October 2017

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ijar.2017.03.014

zbMATH Keywords

complexity theoryprobabilistic inferencerelational Bayesian networks

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• The complexity of Bayesian networks specified by propositional and relational languages
• On the complexity of inference about probabilistic relational models
• Compiling relational Bayesian networks for exact inference
• On the complexity of propositional and relational credal networks
• Complex probabilistic modeling with recursive relational Bayesian networks

Cites work

• Asymptotic Conditional Probabilities: The Unary Case
• Compiling relational Bayesian networks for exact inference
• Complex probabilistic modeling with recursive relational Bayesian networks
• Complexity classes defined by counting quantifiers
• Computational Complexity
• scientific article; zbMATH DE number 5296741 (Why is no real title available?)
• scientific article; zbMATH DE number 3467028 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1149441 (Why is no real title available?)
• Identifying independence in bayesian networks
• Logical and Relational Learning
• Modeling and Reasoning with Bayesian Networks
• On the hardness of approximate reasoning
• Phase transitions of PP-complete satisfiability problems
• Polynomial Space Counting Problems
• Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P
• PP is as Hard as the Polynomial-Time Hierarchy
• PP is closed under intersection
• Probabilistic graphical models.
• Probabilistic Horn abduction and Bayesian networks
• Probabilistic inductive logic programming. Theory and applications
• Subtractive reductions and complete problems for counting complexity classes
• The complexity of combinatorial problems with succinct input representation
• The Complexity of Enumeration and Reliability Problems
• The complexity of weighted and unweighted \(\#\)CSP
• The polynomial-time hierarchy and sparse oracles

Cited in

(5)

• The complexity of Bayesian networks specified by propositional and relational languages
• On the complexity of inference about probabilistic relational models
• The descriptive complexity of Bayesian network specifications
• Compiling relational Bayesian networks for exact inference
• scientific article; zbMATH DE number 1392295 (Why is no real title available?)

This page was built for publication: The effect of combination functions on the complexity of relational Bayesian networks

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