{'fraction_non_alphanumeric': 0.008836524300441826, 'fraction_numerical': 0.0, 'mean_word_length': 5.126126126126126, '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}}
Repeated Redundant Inequalities in Constraint Logic Programming

Future redundant inequalities in a constraint logic program are those that are guaranteed to be subsumed after no more than one subsequent procedure call, usually in the context of a recursive procedure. It has been noted that such inequalities need only be tested for consistency with the current constraint set, thus resulting in dramatic savings in execution speed and space usage. We generalize the notion of future redundancy in a number of ways and thus broaden its applicability. Thus we show how to dramatically improve the performance of a wider class of programs that rely heavily on linear inequalities.