{'fraction_non_alphanumeric': 0.012311901504787962, 'fraction_numerical': 0.0, 'mean_word_length': 5.477876106194691, '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}}
Propositional Calculus via Constraint Networks

Propositional calculus is a well known and widely treated search area. But, studying it, we can see that using the disposition of formulae between them for resolution is absent from the literature. Semantical and syntactical properties have been deeply treated while structure or disposition properties are ignored. Structure being one of the most widely treated approaches to solve constraint networks, we propose an original encoding of propositional formulae into constraint networks to use their structural properties to solve them. In a further work, we wish to define new polynomial classes in propositional calculus using the description of those known in constraint networks.