Authors: Xiaomei Zhong Yang Xu Jun Liu Shuwei Chen
Publish Date: 2012/06/29
Volume: 16, Issue: 10, Pages: 1767-1781
Abstract
This paper is focused on resolutionbased automated reasoning theory in linguistic truthvalued latticevalued logic based on linguistic truthvalued lattice implication algebra Concretely the general form of αresolution principle based on the above latticevalued logic is equivalently transformed into another simpler latticevalued logic system Firstly the general form of αresolution principle for latticevalued propositional logic fancyscriptL n times fancyscriptL 2textPX is equivalently transformed into that for latticevalued propositional logic fancyscriptL n PX A similar conclusion is obtained between the general form of αresolution principle for linguistic truthvalued latticevalued propositional logic fancyscriptL Vn times 2PX and that for latticevalued propositional logic fancyscriptL Vn PX Secondly the general form of αresolution principle for latticevalued firstorder logic fancyscriptL n times fancyscriptL 2 FX is equivalently transformed into that for fancyscriptL n PX Similarly this conclusion also holds for linguistic truthvalued latticevalued firstorder fancyscriptL Vn times 2 FX and fancyscriptL Vn PX The presented work provides a key theoretical support for automated reasoning approaches and algorithms in linguistic truthvalued logic which can further support linguistic information processing for decision making ie reasoning with wordsThis work is partially supported by the National Natural Science Foundation of P R China Grant No 60875034 61175055 61100046 the project TIN20090828 Sichuan Key Technology Research and Development Program of China Grant No 2011FZ0051 and Wireless Administration of Ministry of Industry and Information Technology of China 2011146
Keywords: