{'fraction_non_alphanumeric': 0.029116465863453816, 'fraction_numerical': 0.0, 'mean_word_length': 5.350318471337579, '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}}
General form of α-ordered linear resolution method for lattice-valued logic system with linguistic truth-values

In the present paper, general form of α-ordered linear resolution method is established in lattice-valued logic system with linguistic truth-values. Firstly, general form of α-ordered linear resolution method is investigated in linguistics truth-valued lattice-valued propositional logic system based on linguistics truth-valued lattice implication algebra. It can obtain a resolvent under a linguistic truth-valued level for a set of generalized clauses. Both soundness and weak completeness theorems are established. Then, general form of α-ordered linear resolution method is established in linguistics truth-valued lattice-valued first-order logic system. The soundness theorem is also given. Finally, By using lift lemma, the weak completeness theorem is also obtained. This method provides a new resolution approach for automated reasoning based on lattice-valued logic system.