{'fraction_non_alphanumeric': 0.036016949152542374, 'fraction_numerical': 0.00847457627118644, 'mean_word_length': 4.7682926829268295, '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}}
An implementation of the Davis-Putnam procedure using network structures

The satisfiability (SAT) problem is an important topic in many AI applications, such as theorem proving, decision making, etc. One of the widely adopted approach for SAT problems is the Davis-Putnam procedure (1960). In this paper, we propose an implementation of the Davis-Putnam procedure based on the RETE-like network. By this way, we can gain much efficiency in both CPU time and memory usage.