Linear Time and Space Algorithm for Computing all the Fagin-Halpern Conditional Beliefs Generated From Consonant Belief Functions

Halpern 1990; Smets 1991; Yu and Arasta 1994), Dempster's conditional and Fagin-Halpern (FH) conditional can be considered the most widely used two DST conditional The flexibility and expressiveness of Dempster-Shafer (DS) A widely used approach for carrying out precise computation theoretic models make DS evidence theory (Dempster 1967; of the Dempster's conditional is a matrix calculus 1968; Shafer 1976) an ideal framework for reasoning and based algorithm which generates the Dempster's conditional decision making under uncertainty in Artificial Intelligence masses (Klawonn and Smets 1992; Smets 2002). Therefore, this specialization matrix-based method imposes Computing the DST belief functions and the DST conditionals, a prohibitive burden when dealing with larger FoDs.