{'fraction_non_alphanumeric': 0.012465373961218837, 'fraction_numerical': 0.0, 'mean_word_length': 5.513513513513513, '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}}
A local method for prioritized fusion of temporal information

Information often comes from different sources and merging these sources usually leads to the apparition of inconsistencies. Fusion is the operation consists in restoring the consistency of the merged information by changing a minimum of the initial information. In this paper, we are interested in linear constraints prioritized fusion in the framework of simple temporal problems (STPs). Priority expresses a preference relation between linear constraints and can represent either confidence or quality degrees of the constraints, or the reliability of their sources. We propose a local fusion method which we experiment on random prioritized STP instances.