On the complexity of inference about probabilistic relational models

DOI10.1016/S0004-3702(99)00109-5zbMath0938.68847MaRDI QIDQ1978655

Yanyan Li

Publication date: 4 June 2000

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

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)

Related Items

Probabilistic description logic programs under inheritance with overriding for the semantic Web, Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence, Lower complexity bounds for lifted inference, Fuzzy functional dependencies and Bayesian networks, Markov logic networks, Compiling relational Bayesian networks for exact inference, Learning to assign degrees of belief in relational domains, Combining probabilistic logic programming with the power of maximum entropy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Answering queries from context-sensitive probabilistic knowledge bases
• Approximating probabilistic inference in Bayesian belief networks is NP- hard
• Probabilistic logic
• Probabilistic logic programming
• Probabilistic Horn abduction and Bayesian networks
• Anytime deduction for probabilistic logic
• The computational complexity of probabilistic inference using Bayesian belief networks