{'fraction_non_alphanumeric': 0.017218543046357615, 'fraction_numerical': 0.0, 'mean_word_length': 5.872727272727273, '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}}
On strategies for solving boolean satisfiability problems

The paper deals with one of the most important problems of modern digital systems verification and design - Boolean satisfiability checking. The work analyzes different strategies for SAT solving evaluations. The approach is based on FUDASAT algorithm that employs commonsense reasoning methodology. Problems of variables selection, conflicts analyses and clauses set extensions are discussed. The presented methodology is exemplified on various benchmarks' evaluations. Basing on the results of practical experiments a set of navigation rules, controlling Boolean satisfiability checking process, are formulated. Finally, the author summarizes the benefits of the proposed SAT solving technique.