
## References 40

[1] J. Bolanos, L.M. De Campos, S. Moral, *Propagation of linguistic labels in causal networks*, Proc. of 2nd IEEE Int. Conf. on Fuzzy Systems, Vol. 2, pp. 863–870, 28 March–1 April 1993.

[2] L. Cholvy *Using logic to understand relations between DSmT and Dempster-Shafer Theory*, in pp. 312–
317 of the Proceedings of the Rencontres francophones sur la Logique Floue et ses Applications (LFA
2008), Lens, France, October 16-17, 2008.

[3] L. Comtet, *Sperner Systems*, Sec.7.2 in Advanced Combinatorics: The Art of Finite and Infinite Expansions, D. Reidel Publ. Co., pp. 271-273, 1974.

[4] R. Dedekind, Uber Zerlegungen von Zahlen durch ihre gr ¨ *ossten gemeinsammen Teiler* ¨ , In Gesammelte Werke, Bd. 1. pp. 103-148, 1897.

[5] T. Denœux, *Reasoning with imprecise belief structures*, Technical Report Heudiasys 97/44, available at http://www.hds.utc.fr/˜tdenoeux/.

[6] T. Denœux, *Reasoning with imprecise belief structures*, International Journal of Approximate Reasoning, 20, pp. 79-111, 1999.

[7] J. Dezert J., F. Smarandache, *Panel Discussion on DSmT*, Fusion 2004 International Conference, Stockholm, Sweden (and also in Tutorials on DSmT given in Fusion 2005-2008 Conferences).

[8] J. Dezert J., F. Smarandache, *DSmT: A New Paradigm Shift for Information Fusion*, in Proceedings of Cogis ' 06 Conference, Paris, March 2006.

[9] J. Dezert, A. Tchamova, F. Smarandache, P. Konstantinova, *Target Type Tracking with PCR5 and Dempster's rules: A Comparative Analysis*, in Proceedings of Fusion 2006 International conference on Information Fusion, Fusion 2006, Firenze, Italy, July 10-13, 2006.

[10] J. Dezert, F. Smarandache, *A new probabilistic transformation of belief mass assignment*, in Proceedings of Fusion 2008 Conference, Cologne, Germany, July 2008.

[11] D. Dubois, H. Prade, *On the unicity of Dempster rule of combination*, International Journal of Intelligent Systems, Vol. 1, pp 133-142, 1986.

[12] D. Dubois, H. Prade, Representation and combination of uncertainty with belief functions and possibility measures, Computational Intelligence, 4, pp. 244-264, 1988.

[13] M.C. Florea,Combinaison d'informations het´ erog ´ enes dans le cadre unificateur des ensembles al ` *eatoires* ´
: Approximations et robustesse, Ph.D. Thesis, Laval University, Canada, July 2007.

[14] J.W. Guan, D.A. Bell, *Generalizing the Dempster-Shafer rule of combination to Boolean algebras*, Proc.

of IEEE/ACM Int. Conf. on Developing and Managing Projects, Washington, March, pp. 229–236, 1993.

[15] T. Inagaki, *Interdependence between safety-control policy and multiple-sensor schemes via DempsterShafer theory*, IEEE Trans. on reliability, Vol. 40, no. 2, pp. 182-188, 1991.

[16] M. Lamata, S. Moral, *Calculus with linguistic probabilities and beliefs*, In R. R. Yager, M. Fedrizzi, and J. Kacprzyk, editors, Advances in Dempster-Shafer Theory of Evidence, pp. 133-152, Wiley.

[17] E. Lefevre, O. Colot, P. Vannoorenberghe, *Belief functions combination and conflict management*, Information Fusion Journal, Elsevier Publisher, Vol. 3, No. 2, pp. 149-162, 2002.

[18] E. Lefevre, O. Colot, P. Vannoorenberghe, Reply to the Comments of R. Haenni on the paper "Belief functions combination and conflict management", Information Fusion Journal, Elsevier Publisher, Vol. 4, pp. 63-65, 2003.