{'fraction_non_alphanumeric': 0.017241379310344827, 'fraction_numerical': 0.0, 'mean_word_length': 5.326732673267327, '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}}
Tree Decomposition of Disjunctive Fuzzy Temporal Constraint Networks

The Disjunctive Fuzzy Temporal Constraint Networks model allows to express complex temporal constraints, but its general complexity is exponential. There is a subset of these networks, having a tree structure, which can be solved in polinomial time. Thus, it can be interesting to decide if a Disjunctive Fuzzy Temporal Constraint Network can be reduced to an equivalent network with tree structure. In order to study the usefulness of this approach, an evaluation study has been carried out, generating random test problems, whose results are presented on this paper.