{'fraction_non_alphanumeric': 0.008368200836820083, 'fraction_numerical': 0.0020920502092050207, 'mean_word_length': 5.554794520547945, '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}}
Evidential Reasoning for Heuristic Algorithms to Solve Interval Algebra Network

Evidential Reasoning provides quantitative enhancements to the reasoning formalisms which use set based algebra. Interval Algebra is a Temporal Reasoning formalism which uses sets as representation forms and employs tools based on set operations. The traditional reasoning in the Interval Algebra is to apply a search process, Backtrack search, which takes exponential runtime. We augment Interval Algebra with Evidential techniques to make it more expressive and make use of the quantitative enhancements as heuristics to develop backtrack free algorithms which are sound with polynomial runtime. We evaluate efficiency of the algorithms experimentally by generating random instances of the Interval Algebra network. The percentage of success is greater than 90 for the best of these algorithms and its runtime is very low when compared with that of backtrack search method.