在格值命题逻辑系统L2n+1P(X)上,提出了半正则的正广义文字和半正则的负广义文字的概念,进一步给出了半正则广义子句和半正则广义予句集的定义,详细地讨论了L2n+1P(X)上以中界元M为归结水平的半正则广义文字之间的M-归结性,最后,给出了L2n+1P(X)上基于半正则广义文字的归结水平为M的归结自动推理算法,并验证了其可靠性和完备性。
Abstract: In this paper, definitions of sub-regular positive generalized literal and sub-regular negative generalized literals in lattice-valued propositional logic L2n+1P(X) are given. Furthermore, definitions of sub-regular generalized clause and sub-regular generalized clause set are proposed. Then M-resolvent between sub-regular generalized literals is investigated. Based on above discussion, an automated reasoning algorithm is given and its soundness and completeness are proved.