scientific article; zbMATH DE number 1071874

zbMATH Open0881.68054arXiv1812.09086MaRDI QIDQ4359174FDOQ4359174

Authors: Sławomir T. Wierzchoń, M. A. Kłotopek, Maciej Michalewicz 

Publication date: 29 January 1998

Full work available at URL: https://arxiv.org/abs/1812.09086

Title of this publication is not available (Why is that?)

Recommendations

• An algorithm for finding most likely explanations in valuation based systems
• Most Inforbable Explanations: Finding Explanations in Bayesian Networks That Are Both Probable and Informative
• A recurrence local computation approach towards ordering composite beliefs in Bayesian belief networks
• The complexity of finding \(k\)th most probable explanations in probabilistic networks

zbMATH Keywords

Bayesian belief networkmost plausible explanation

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Parallel algorithms in computer science (68W10)

Cited In (2)

• An algorithm for finding most likely explanations in valuation based systems
• Removing partial inconsistency in valuation-based systems

This page was built for publication:

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