J. A. Barnett, Computational Methods for a Mathematical Theory of Evidence, Proc. of IJCAI, vol.81, pp.868-875, 1981.

A. Björklund, T. Husfeldt, P. Kaski, and M. Koivisto, Trimmed Moebius inversion and graphs of bounded degree, Theory of Computing Systems, vol.47, issue.3, pp.637-654, 2010.

A. Björklund, T. Husfeldt, P. Kaski, M. Koivisto, J. Nederlof et al., Fast zeta transforms for lattices with few irreducibles, ACM TALG, vol.12, issue.1, p.4, 2016.

M. Chaveroche, F. Davoine, and V. Cherfaoui, Calcul exact de faible complexité des décompositions conjonctive et disjonctive pour la fusion d'information, Proc. of GRETSI, 2019.

M. Chaveroche, F. Davoine, and V. Cherfaoui, Efficient algorithms for Möbius Transformations and their applications to Dempster-Shafer Theory, 2019.

A. Dempster, A Generalization of Bayesian Inference, Journal of the Royal Statistical Society. Series B (Methodological), p.30, 1968.

J. Gordon and E. H. Shortliffe, A method for managing evidential reasoning in a hierarchical hypothesis space, Artificial intelligence, vol.26, issue.3, pp.323-357, 1985.

P. Kaski, J. Kohonen, and T. Westerbäck, Fast Möbius inversion in semimodular lattices and U-labelable posets, 2016.

R. Kennes, Computational aspects of the Mobius transformation of graphs, IEEE Transactions on Systems, Man, and Cybernetics, vol.22, issue.2, pp.201-223, 1992.

A. Sarabi-jamab and B. N. Araabi, Information-Based Evaluation of Approximation Methods in Dempster-Shafer Theory, IJUFKS, vol.24, issue.04, pp.503-535, 2016.

G. Shafer, A Mathematical Theory of Evidence, 1976.

G. Shafer and R. Logan, Implementing Dempster's rule for hierarchical evidence, Artificial Intelligence, vol.33, issue.3, pp.271-298, 1987.

P. P. Shenoy and G. Shafer, Propagating Belief Functions with Local Computations, IEEE Expert, vol.1, issue.3, pp.43-52, 1986.

N. Wilson, Algorithms for Dempster-Shafer Theory, Handbook of Defeasible Reasoning and Uncertainty Management Systems: Algorithms for Uncertainty and Defeasible Reasoning, pp.421-475, 2000.