An algorithm for finding MAPs for belief networks through cost-based abduction

DOI10.1016/S0004-3702(98)00074-5zbMath0908.68163OpenAlexW1969373224MaRDI QIDQ5906312

Ashraf M. Abdelbar

Publication date: 12 January 1999

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

Full work available at URL: https://doi.org/10.1016/s0004-3702(98)00074-5

zbMATH Keywords

complexityuncertaintybelief revisionexplanationprobabilistic reasoning

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fusion, propagation, and structuring in belief networks
• ``Neural computation of decisions in optimization problems
• A linear constraint satisfaction approach to cost-based abduction
• Cost-based abduction and MAP explanation
• Finding MAPs for belief networks is NP-hard
• A Prolog-like inference system for computing minimum-cost abductive explanations in natural-language interpretation
• Belief networks revisited
• Polynomial solvability of cost-based abduction
• Neural networks and physical systems with emergent collective computational abilities.

This page was built for publication: An algorithm for finding MAPs for belief networks through cost-based abduction