Abstract
This paper deals with belief change in the framework of Dempster-Shafer theory in the context where an agent has a prejudice, i.e., a priori knowledge about a situation. This situation is modeled as a sequence (p, m) where p reflects the prejudices of an agent and m is a mass function that represents the agent’s uncertain beliefs. In contrast with the Latent Belief Structure introduced by Smets where a mass is decomposed into a pair of separable mass functions called respectively the confidence and diffidence, m can be any mass function (i.e., not necessarily separable) and p is not a mass. The aim of our study is to propose a framework in which the evolution of prejudices and beliefs are described through the arrival of new beliefs. Several cases of prejudice are described: the strong persistent prejudice (which never evolves and forbids beliefs to change), the prejudice that is slightly decreasing each time a belief contradicts it, etc.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
“(good or bad) opinion that one forms in advance” (Lanoue, Discours pol. et milit., 436 in Littré,1587).
- 2.
A mass is dogmatic when \(m(\varOmega )=0\).
- 3.
Specialization was introduced in [6], m specializes \(m'\) iff there exists a square matrix \(\Sigma \) with general term \(\sigma (A,B)\) being a proportion (i.e., verifying \(\sum _{A}\sigma (A,B)=1\), for any B. \(\sigma (A,B)>0\) implies \(A\subseteq B\) for any A, B) such that \(m(A)=\sum _B \sigma (A,B)m'(B)\) for all A. In [12], the definition of specialization matrix is taken in a broader sense: only imposing that \(\sigma (A,B)>0\) implies \(A\cap B\ne \emptyset \) for any A, B.
References
Alchourrón, C.E., Gärdenfors, P., Makinson, D.: On the logic of theory change: partial meet contraction and revision functions. J. Symb. Log. 50(2), 510–530 (1985)
Allport, G.W., Clark, K., Pettigrew, T.: The Nature of Prejudice. Addison-Wesley Reading, MA (1954)
Denœux, T.: Conjunctive and disjunctive combination of belief functions induced by nondistinct bodies of evidence. Artif. Intell. 172(2–3), 234–264 (2008)
Dubois, D., Denoeux, T.: Conditioning in dempster-shafer theory: prediction vs. revision. In: Denoeux, T., Masson, M.H. (eds.) Belief Functions: Theory and Applications. AISC, vol. 164, pp. 385–392. Springer, Berlin, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29461-7_45
Dubois, D., Faux, F., Prade, H.: Prejudice in uncertain information merging: pushing the fusion paradigm of evidence theory further. Int. J. Approx. Reason. 121, 1–22 (2020)
Dubois, D., Prade, H.: On the unicity of Dempster rule of combination. Int. J. Intell. Syst. 1(2), 133–142 (1986)
Ginsberg, M.L.: Non-monotonic reasoning using Dempster’s rule. In: Proceedings of the National Conference on Artificial Intelligence. Austin, TX, 6–10 August 1984, pp. 126–129 (1984)
Katsuno, H., Mendelzon, A.O.: Propositional knowledge base revision and minimal change. Artif. Intell. 52(3), 263–294 (1991)
Kramosil, I.: Measure-theoretic approach to the inversion problem for belief functions. Fuzzy Sets Syst. 102(3), 363–369 (1999)
Kramosil, I.: Probabilistic Analysis of Belief Functions. Kluwer, New York (2001)
Lukaszewski, T.: Updating the evidence in the Dempster-Shafer theory. Informatica Lith. Acad. Sci. 10, 127–141 (1999)
Ma, J., Liu, W., Dubois, D., Prade, H.: Revision rules in the theory of evidence. In: 2010 22nd IEEE International Conference on Tools with Artificial Intelligence, vol. 1, pp. 295–302. IEEE (2010)
Pichon, F.: Belief functions: canonical decompositions and combination rules. Ph.D. thesis, Université de Technologie de Compiègne (2009)
Pichon, F., Denoeux, T.: On latent belief structures. In: Mellouli, K. (ed.) ECSQARU 2007. LNCS (LNAI), vol. 4724, pp. 368–380. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-75256-1_34
Shafer, G.: A Mathematical Theory of Evidence. Princeton University Press, Princeton (reedition 2021) (1976)
Shenoy, P.P.: Conditional independence in valuation-based systems. Int. J. Approx. Reason. 10(3), 203–234 (1994)
Smets, P.: The canonical decomposition of a weighted belief. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI), Montreal, 20–25 August, vol. 2, pp. 1896–1901 (1995)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Dupin de Saint-Cyr, F., Faux, F. (2024). Integrating Evolutionary Prejudices in Belief Function Theory. In: Bouraoui, Z., Vesic, S. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2023. Lecture Notes in Computer Science(), vol 14294. Springer, Cham. https://doi.org/10.1007/978-3-031-45608-4_30
Download citation
DOI: https://doi.org/10.1007/978-3-031-45608-4_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-45607-7
Online ISBN: 978-3-031-45608-4
eBook Packages: Computer ScienceComputer Science (R0)