Abstract
This paper extend the α—resolution principle based on classical logic system. An α-generalized resolution method is presented in Linguistic Truth-Valued lattice-valued propositional logic system based on linguistic truth-valued lattice implication algebra. Both soundness and weak completeness theorems for α-generalized resolution method are established in Linguistic Truth-Valued lattice-valued propositional logic system. The proposed approach provides a foundation for α—generalized resolution method under linguistic truth-valued level in a set of general generalized clauses.
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.
