Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
