摘要: Most Relevant Explanation (MRE) is an inference task in Bayesian networks that finds the most relevant partial instantiation of target variables as explanation for given evidence by maximizing Generalized Bayes Factor (GBF). No exact MRE algorithm has been developed previously except exhaustive search. This paper fills void introducing two Breadth-First Branch-and-Bound (BFBnB) algorithms solving based on novel upper bounds GBF. One bound created decomposing computation GBF using a blanket decomposition variables. The other improves first ways. to split blankets are too large converting auxiliary nodes into pseudo-targets so scale problems. perform summations instead maximizations some each blanket. Our empirical evaluations show proposed BFBnB make tractable could not be solved previously.