{'fraction_non_alphanumeric': 0.021768707482993196, 'fraction_numerical': 0.0, 'mean_word_length': 5.237288135593221, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An axiomatic foundation of Dempster-Shafer theory

This abstract introduces an axiomatic study on Dempster-Shafer theory of handling uncertainty in AI systems. A Dempster-Shafer belief function, based on probabilities, is intended to measure the degree of support a piece of evidence provides for various propositions in its domain. Dempster's rule provides a method of combining evidence that may justify partial beliefs. Shafer argued that the Bayesian theory is a special case of this theory and that Bayes rule of conditioning is a special case of Dempster's rule of combination. However, the development of evidence models, including Dempster's rule, is based on intuition and lacks the axiomatic foundation of probability theory.