From Influence Diagrams to junction Trees

[1]  Pierre Ndilikilikesha,et al.  Potential influence diagrams , 1994, Int. J. Approx. Reason..

[2]  Daniel Kahneman,et al.  Probabilistic reasoning , 1993 .

[3]  Ross D. Shachter,et al.  Using Potential Influence Diagrams for Probabilistic Inference and Decision Making , 1993, UAI.

[4]  Ross D. Shachter,et al.  Decision Making Using Probabilistic Inference Methods , 1992, UAI.

[5]  Prakash P. Shenoy,et al.  Valuation-Based Systems for Bayesian Decision Analysis , 1992, Oper. Res..

[6]  Ross D. Shachter,et al.  Dynamic programming and influence diagrams , 1990, IEEE Trans. Syst. Man Cybern..

[7]  Steffen L. Lauritzen,et al.  Bayesian updating in causal probabilistic networks by local computations , 1990 .

[8]  Uue Kjjrull.  Triangulation of Graphs { Algorithms Giving Small Total State Space Triangulation of Graphs { Algorithms Giving Small Total State Space , 1990 .

[9]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[10]  Kristian G. Olesen,et al.  HUGIN - A Shell for Building Bayesian Belief Universes for Expert Systems , 1989, IJCAI.

[11]  David J. Spiegelhalter,et al.  Local computations with probabilities on graphical structures and their application to expert systems , 1990 .

[12]  H.-G. Leimer.  Triangulated Graphs with Marked Vertices , 1988 .

[13]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems , 1988 .

[14]  Ross D. Shachter.  Evaluating Influence Diagrams , 1986, Oper. Res..

[15]  Catriel Beeri,et al.  On the Desirability of Acyclic Database Schemes , 1983, JACM.

[16]  D. Rose.  Triangulated graphs and the elimination process , 1970 .