{'fraction_non_alphanumeric': 0.02268041237113402, 'fraction_numerical': 0.002061855670103093, 'mean_word_length': 5.230769230769231, '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}}
Length-lex bound consistency for knapsack constraints

This paper considers the length-lex domain for set-variables in constraint programming which includes not only membership but also cardinality and lexicographic information. The paper studies how to enforce bound consistency on a knapsack constraint over a set variable in this domain and proposes a bound-consistency algorithm which runs in O(c log n) time with a one-time preprocessing cost O(cn2) when the constraint is posted.