{'fraction_non_alphanumeric': 0.041223404255319146, 'fraction_numerical': 0.0, 'mean_word_length': 4.8828125, '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}}
Variable Elimination for Disequations in Generalized Linear Constraint Systems

This paper is concerned with the case of generalized linear constraint systems. A generalized linear constraints system is the cojunction of a sub-system of equations E, a sub-system of inequations I (≤), and a sub-system of disequations D (¬=). We first of all establish that the variable elimination operation on a generalized linear constraint system E, I, D has, as its result, a generalized linear constraint system E', I', D'. We then show that E', I' does not depend on D, and that the disequations of D are independent from one another for the variable elimination operation. Next, we present two algorithms for variable elimination in the disequation sub-system D