格值逻辑命题逻辑(L_n×L_2)P(X)中广义文字的α-归结性  

α-resolvability of generalized literals in lattice-valued propositional logic(L_n×L_2)P( X )

作　　者：张家锋[1] 曹发生 

机构地区：[1]贵州民族大学理学院,贵阳550025 [2]贵州工程应用技术学院理学院,贵州毕节551700

出　　处：《计算机工程与应用》2015年第24期8-11,共4页Computer Engineering and Applications

基　　金：国家自然科学基金(No.61175055;No.61305074);贵州省科学技术基金项目(No.LKB[2012]02);贵州民族大学引进人才项目(No.15XRY006)

摘　　要：由于格值逻辑中广义文字结构的复杂性,这必然增加判断两个广义文字是否为α-归结对的难度。根据真值域L_n×L_2的结构特性和归结水平α的特点,研究了真值域为一类格蕴涵代数L_n×L_2的格值命题逻辑系统(L_n×L_2)P(X)中0-IESF与其他广义文字之间的α-归结性,得到了两个广义文字可进行α-归结的条件。Because of the complexity of generalized literals structure in lattice-valued logic, it leads to difficult to judge two generalized literals whether form resolution pair or not. According to particular structure of truth valued range L_n×L_2 and the characteristic of resolution level α, the resolvability of between 0-IESF and other generalized literals in lattice-valued propositional logic system（L_n×L_2）P（ X ） based on one class of lattice implication algebras L_n× L_2, and the determination conditions on that two generalized literals can form resolution pair.

关 键 词：自动推理 归结域 格值逻辑 格蕴涵代数 

分 类 号：O142[理学—数学]