格值命题逻辑系统中广义文字的正规性  

On normal properties of generalized literals in LP(X)

作　　者：何星星[1] 徐扬[1] 李莹芳[1] 张家锋[1] 

机构地区：[1]西南交通大学智能控制开发中心,成都610031

出　　处：《计算机工程与应用》2012年第10期43-46,127,共5页Computer Engineering and Applications

基　　金：国家自然科学基金(No.60875034);西南交通大学博士生创新基金

摘　　要：基于格蕴涵代数的格值命题逻辑系统能定性地刻画不可比较性和不精确性。广义文字是该系统中α-归结自动推理的核心概念,是α-归结中的最基本单元。公式的正规性是α-归结原理中保持完备性的重要条件,其语义性质是公式形式的重要反映。从语义角度研究了广义文字的正规性,给出了两种典型正规公式F1→F2和(F1→F2)'的真值情况。为讨论广义文字的形式及其α-可归结性提供了理论基础。Lattice-valued propositional logic based on lattice implication algebra can represent incomparability and imprecise. Generalized literal is a core concept of a-resolution principle in this logic system, and it is the basic unit in a-resolution. The normal property of logical formulae is one of important properties in a-resolution automated rea-soning for persevering completeness, its semantic properties are characterized by syntactic of logical formulae. In this paper, some normal properties of generalized literals in LP(X)are studied from a semantic view. Concretely, whether the truth values of two traditional types of formulae(i.e., F1 →F2,(F1→F2)')are normal is discussed. It provides a theoretical foundation for studying the forms of generalized literals and its a-resolution fields.

关 键 词：格值命题逻辑 α-归结原理 广义文字 正规性 语义性质 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程]