On the complexity of inference about probabilistic relational models

DOI10.1016/S0004-3702(99)00109-5zbMATH Open0938.68847MaRDI QIDQ1978655FDOQ1978655

Authors: Yanyan Li 

Publication date: 4 June 2000

Published in: Artificial Intelligence (Search for Journal in Brave)

Recommendations

• The complexity of Bayesian networks specified by propositional and relational languages
• The effect of combination functions on the complexity of relational Bayesian networks
• Lower complexity bounds for lifted inference
• The complexity of inferences and explanations in probabilistic logic programming
• On the semantics and complexity of probabilistic logic programs

zbMATH Keywords

Bayesian networksfirst-order logicknowledge based model construction

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Cites Work

• Probabilistic logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximating probabilistic inference in Bayesian belief networks is NP- hard
• Probabilistic logic programming
• Probabilistic Horn abduction and Bayesian networks
• The computational complexity of probabilistic inference using Bayesian belief networks
• Anytime deduction for probabilistic logic
• Answering queries from context-sensitive probabilistic knowledge bases
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (18)

• Compiling relational Bayesian networks for exact inference
• Reasoning with BKBs -- algorithms and complexity
• Title not available (Why is that?)
• The dichotomy of probabilistic inference for unions of conjunctive queries
• Languages for probabilistic modeling over structured and relational domains
• Context-specific independence in directed relational probabilistic models and its influence on the efficiency of Gibbs sampling
• Some methods for computing component distribution probabilities in relational structures
• Learning to assign degrees of belief in relational domains
• Fuzzy functional dependencies and Bayesian networks
• Lower complexity bounds for lifted inference
• Probabilistic description logic programs under inheritance with overriding for the semantic Web
• The relational structure of belief networks
• Markov logic networks
• Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence
• Relational Analysis and Precision via Probabilistic Abstract Interpretation
• Combining probabilistic logic programming with the power of maximum entropy
• Probabilistic inference and monadic second order logic
• PRM inference using Jaffray \& Faÿ's local conditioning

This page was built for publication: On the complexity of inference about probabilistic relational models

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