A recurrence local computation approach towards ordering composite beliefs in Bayesian belief networks

DOI10.1016/S0888-613X(05)80004-0zbMath0782.68109MaRDI QIDQ1209534

Bon K. Sy

Publication date: 16 May 1993

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

zbMATH Keywords

partial orderprobabilistic inferencelocal computationBayesian belief networkqualitative interval arithmetic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

An adaptive reasoning approach towards effficient ordering of composite hypotheses

Uses Software

• NESTOR

Cites Work

• Fusion, propagation, and structuring in belief networks
• Probabilistic inference in multiply connected belief networks using loop cutsets
• Distributed revision of composite beliefs
• Fusion and propagation with multiple observations in belief networks
• Reasoning composite beliefs using a qualitative approach.
• An adaptive reasoning approach towards effficient ordering of composite hypotheses
• The computational complexity of probabilistic inference using Bayesian belief networks
• Fundamental concepts of qualitative probabilistic networks
• A Probabilistic Causal Model for Diagnostic Problem Solving Part I: Integrating Symbolic Causal Inference with Numeric Probabilistic Inference
• A Probabilistic Causal Model for Diagnostic Problem Solving Part II: Diagnostic Strategy
• An algebra of bayesian belief universes for knowledge‐based systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A recurrence local computation approach towards ordering composite beliefs in Bayesian belief networks