Probabilistic conflicts in a search algorithm for estimating posterior probabilities in Bayesian networks
type: Item
instance of: scholarly article
title: Probabilistic conflicts in a search algorithm for estimating posterior probabilities in Bayesian networks
zbMATH Open document ID: 0906.68116
DOI: 10.1016/S0004-3702(96)00022-7
author: D. Massart
published in: Artificial Intelligence
publication date: 1998-07-23T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68U99
zbMATH DE Number: 1178617
zbMATH Keywords: Bayesian networks
zbMATH Keywords: conflicts
zbMATH Keywords: model-based diagnosis
zbMATH Keywords: probabilistic inference
MaRDI profile type: Publication
cites work: Q5679729
cites work: Approximating probabilistic inference in Bayesian belief networks is NP- hard
cites work: Characterizing diagnoses and systems
cites work: Diagnosing multiple faults
cites work: Q3795276
cites work: Q5753542
cites work: Gibbs sampling in Bayesian networks
cites work: Q3201783
cites work: Depth-first iterative-deepening: An optimal admissible tree search
cites work: Q4734791
cites work: Fusion, propagation, and structuring in belief networks
cites work: Evidential reasoning using stochastic simulation of causal models
cites work: Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities
cites work: Probabilistic Horn abduction and Bayesian networks
cites work: Q5571447
cites work: A theory of diagnosis from first principles
cites work: Q3979383
full work available at URL: s0004-3702(96)00022-7
OpenAlex ID: W1987051875
description: scientific article; zbMATH DE number 1178617