{"title":"基于语言真值格值命题逻辑系统的α-广义分解方法","authors":"Weitao Xu","doi":"10.1109/ISKE.2017.8258781","DOIUrl":null,"url":null,"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.","PeriodicalId":208009,"journal":{"name":"2017 12th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"α-generalized resolution method based on linguistic truth-valued lattice-valued propositional logic system\",\"authors\":\"Weitao Xu\",\"doi\":\"10.1109/ISKE.2017.8258781\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":208009,\"journal\":{\"name\":\"2017 12th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)\",\"volume\":\"92 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 12th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISKE.2017.8258781\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 12th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISKE.2017.8258781","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
α-generalized resolution method based on linguistic truth-valued lattice-valued propositional logic system
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.