On the complexity of inference about probabilistic relational models
type: Item
instance of: scholarly article
title: On the complexity of inference about probabilistic relational models
zbMATH Open document ID: 0938.68847
DOI: 10.1016/S0004-3702(99)00109-5
author: Yanyan Li
published in: Artificial Intelligence
publication date: 2000-06-04T00:00:00Z
Mathematics Subject Classification ID: 68T35
zbMATH DE Number: 1454407
zbMATH Keywords: knowledge based model construction
zbMATH Keywords: Bayesian networks
zbMATH Keywords: first-order logic
MaRDI profile type: Publication
cites work: The computational complexity of probabilistic inference using Bayesian belief networks
cites work: Approximating probabilistic inference in Bayesian belief networks is NP- hard
cites work: Anytime deduction for probabilistic logic
cites work: Q3795276
cites work: Q4936134
cites work: Q4385525
cites work: Q4159038
cites work: Probabilistic logic programming
cites work: Answering queries from context-sensitive probabilistic knowledge bases
cites work: Probabilistic logic
cites work: Probabilistic Horn abduction and Bayesian networks
description: scientific article; zbMATH DE number 1454407