{'fraction_non_alphanumeric': 0.006993006993006993, 'fraction_numerical': 0.0, 'mean_word_length': 5.662790697674419, '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 efficient procedure for obtaining implication relations and its application to redundancy identification

The procedure used in static learning extracts implication relations of the logic circuit. The number of extracted implication relations depends on the order of signal lines processed. In this paper we propose an efficient method to extract implication relations by considering the order of signal lines to be processed. Experimental results show that the proposed order finds more implication relations than others and is effective for redundancy identification.