四值非链格值命题逻辑系统L4P(X)的语义归结方法*

为了提高归结方法处理带有不可比较性信息的能力,给出了四值格值命题逻辑系统上的语义归结原理,并证明了其可靠性和完备性,其上归结原理的研究为归结算法的实现提供了理论基础,从而为处理含有不可比真值的格值逻辑系统在智能推理系统中的实际应用提供了有力的支持。     

语言真值格值命题逻辑中的α-语义归结方法

语言值智能信息处理是人工智能的一个重要研究方向,基于归结原理的自动推理因易于在计算机上实现而得到广泛研究。为了提高基于语言真值格值逻辑的α-归结原理的效率,将语义归结策略应用于α-归结原理,研究了基于格值逻辑的归结自动推理方法。首先给出了语言真值格值命题逻辑系统的α-语义归结与L_nP(X)中相应归结水平的语义归结之间的等价性,并通过实例说明其有效性。接着,给出了语言真值格值命题逻辑系统的α-语义归结算法,并证明了该算法的可靠性和完备性。     

一类具有3种否定的模糊模态命题逻辑

对不同否定知识的认知、区分、表达、推理及计算是模糊知识研究处理的一个基础。具有矛盾否定、对立否定和中介否定的模糊命题逻辑形式系统FLCOM是一种能够完整描述模糊知识中的不同否定及其关系与规律的理论。基于FLCOM和中介模态命题逻辑MK,提出一类具有3种否定的模糊模态命题逻辑MKCOM及其扩充系统MTCOM,MS₄COM和MS₅COM;讨论了MKCOM的语义和语法解释,并证明了MKCOM的可靠性定理和完备性定理。     

基于n-值(L)ukasiewicz命题逻辑的概率计量化推理系统

通过把n-值Lukasiewicz命题逻辑中公式的概率真度函数抽象为模态词,把概率真度函数的基本恒等式抽象为关于模态词的公理,建立一个模态化的形式推理系统,构建其语构理论及语义理论,证明该系统关于概率真度函数的完备性定理,从而为概率计量逻辑奠定逻辑基础.     

基于n-值ukasiewicz命题逻辑的概率计量化推理系统

通过把n-值ukasiewicz命题逻辑中公式的概率真度函数抽象为模态词,把概率真度函数的基本恒等式抽象为关于模态词的公理,建立一个模态化的形式推理系统,构建其语构理论及语义理论,证明该系统关于概率真度函数的完备性定理,从而为概率计量逻辑奠定逻辑基础.     

多值模态逻辑的计量化方法

在多值模态逻辑中构建了n-值模态模型及相应的语义理论,并指出这种语义是经典模态逻辑语义的推广.定义了W,R n-型框架的概念,并在该框架下用归纳的方法构建了由模态公式诱导的局部化映射,给出公式的局部化真度的概念,并指出任意模态公式的局部化真度都可以转化为另一个不含模态词的公式在同一可能世界处的局部化真度.定义了模态公式的全局真度,并证明了当某模态公式不含模态词时,其全局真度与其在一般命题逻辑中的真度一致.     

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

基于格蕴涵代数的格值命题逻辑系统能定性地刻画不可比较性和不精确性。广义文字是该系统中α-归结自动推理的核心概念,是α-归结中的最基本单元。公式的正规性是α-归结原理中保持完备性的重要条件,其语义性质是公式形式的重要反映。从语义角度研究了广义文字的正规性,给出了两种典型正规公式F1→F2和(F1→F2)'的真值情况。为讨论广义文字的形式及其α-可归结性提供了理论基础。     

命题逻辑中非子句α-有序线性广义归结方法

为了处理在不确定性环境下的自动演绎,重点研究了基于自动推理理论的归结方法,其自动推理理论是真值定义在格蕴涵代数（lattice implication algebra,LIA）结构上格值逻辑系统中的。在已有的确定真值水平α二元归结研究的基础上,作为其继续研究和扩展,引入了基于格值命题逻辑系统LP( X )的非子句多元α-有序线性广义归结方法和演绎,这从本质上避免了一个非子句广义归结演绎到规范子句的形式。随后,得到LP( X )中的非子句多元α-有序线性广义归结演绎是可靠和完备的。该研究工作为格值命题逻辑中基于自动推理的归结提供了一个更有效的方法。     

中介命题逻辑一种新的无穷值语义模型及意义

中介逻辑ML（Medium Logic）,自建立了它的三值语义模型后,ML就被许多学者认定为三值逻辑。对于中介逻辑核心理论的中介命题逻辑系统,潘给出了一种无穷值语义模型,并证明了中介命题逻辑在此模型下具有可靠性与完备性。在此基础上,给出一种真值域为[0,λ)∪(λ,1](λ∈(0.5,1))的无穷值语义模型,研究了它的性质,证明了中介命题逻辑在该模型下也具有可靠性与完备性。新模型的存在进一步表明,认定中介逻辑是一种三值逻辑的理由是不充分的。新模型不仅反映了中介逻辑的基本思想,而且为中介逻辑在其他领域的应用提供了基础。     

BL*系统的一种扩张及相关性质

对BR₀代数,Boole 代数以及BL*系统,命题演算形式系统L进行了研究。首先讨论了BR₀代数与Boole 代数间的相互关系,随后在BL*系统中分别添加公理模式(A →B) →¬A ∨ B或(A →(B → C)) →(A ∧ B → C)得到BL*系统的两种扩张,并证明了BL*系统的这两种扩张与命题演算形式系统L之间是等价的。     

分层格值命题逻辑系统中几类推理规则的讨论

在基于格值逻辑的不确定性推理的研究中,推理规则的选取是其重要研究内容之一。基于分层格值命题逻辑系统,提出了几类既包含有语义又含有语法的推理规则,且这些推理规则具备协调水平的特性;同时也证明了这几类推理规则在一定程度上有闭性。     

Linguistic truth-valued lattice-valued propositional logic system ?P(X) based on linguistic truth-valued lattice implication algebra

In the semantics of natural language, quantification may have received more attention than any other subject, and syllogistic reasoning is one of the main topics in many-valued logic studies on inference. Particularly, lattice-valued logic, a kind of important non-classical logic, can be applied to describe and treat incomparability by the incomparable elements in its truth-valued set. In this paper, we first focus on some properties of linguistic truth-valued lattice implication algebra. Secondly, we introduce some concepts of linguistic truth-valued lattice-valued propositional logic system ?P(X), whose truth-valued domain is a linguistic truth-valued lattice implication algebra. Then we investigate the semantic problem of ?P(X). Finally, we further probe into the syntax of linguistic truth-valued lattice-valued propositional logic system ?P(X), and prove the soundness theorem, deduction theorem and consistency theorem.     

ON SEMANTICS OF L-VALUED FIRST-ORDER LOGIC Lvft

Abstract

Many-valued logic system always plays a crucial role in artificial intelligence. Many researchers have paid considerable attention to lattice-valued logic with truth values in a lattice. In this paper, based on lattice implication algebras introduced by Xu (Journal of Southwest Jiaolong University (in Chinese), Sum. No. 89(1), 20-27, 1993, and L-valued propositional logic _vft, established by Xu et al. (Information Sciences, 114, 20S-235, 1999a), the semantics of a L-type lattice-valued first-order logic L_vft, with truth values in lattice implication algebras were investigated. Some basic concepts about semantics of L_vftsuch as the language and the interpretation etc. were given and some semantic properties also were discussed. Finally, a concept of g-Skolem standard form was introduced, and it was shown that the unsatisfiability of a given lattice-valued formula was equivalent to that of its g-Skolem standard form. It will become a foundation to investigate the resolution principle based on first-order logic L_vft     

A Game Semantics for Grz

We present a game semantics for modal propositional logic Grz.Since intuitionistic logic may be embedded into Grz, the semanticsalso covers intuitionistic propositional logic. That semanticsis simpler than Lorenzen's ‘dialogue’ games, butlacks predicates.     

基于模糊命题模态逻辑的形式推理系统

探讨基于可信度的模糊命题模态逻辑的形式推理,给出相关的模糊Kripke语义描述.其研究目的旨在解决基于模态命题逻辑的模糊推理的能行问题.在研究过程与方法上,以完全形式化的方法将模糊模态逻辑语法和语义统一在一个形式系统中,以模糊约束作为基本表达式,给出推理规则,建立了相应的模糊推理形式系统,并以形式系统中模糊约束集的可满足性来表示模糊推理的有效性,使模糊推理过程变得容易,为最终在计算机上实现基于模态逻辑的模糊推理打下了一定的基础.主要结论是证明了基于可满足性的模糊推理形式系统的可靠性与完备性.     

标记模态归结的推广

本文将作者提出的高效的命题模态Ｄ逻辑的标记模态归结方法推广到了命题模态逻辑Ｋ,Ｋ４,Ｄ４,Ｔ,Ｓ４系统,建立了上述命题模态逻辑的标记归结形式系统ＭＲＫ,ＭＲＫ４,ＭＲＤ４,ＭＲＴ,ＭＲＳ４,并用转移子句模式的方法,借助于标记模态归结对命题模态Ｄ逻辑的可靠性结果,证明了标记模态归结系统ＭＲＫ,ＭＲＫ４,ＭＲＤ４,ＭＭＲＴ,ＭＲＳ４分别关于命题模式逻辑Ｋ,Ｋ４、Ｄ４,Ｔ,Ｓ４的可靠性,进而得到了它们的     

Filter-based resolution principle for lattice-valued propositional logic LP(X)

As one of most powerful approaches in automated reasoning, resolution principle has been introduced to non-classical logics, such as many-valued logic. However, most of the existing works are limited to the chain-type truth-value fields. Lattice-valued logic is a kind of important non-classical logic, which can be applied to describe and handle incomparability by the incomparable elements in its truth-value field. In this paper, a filter-based resolution principle for the lattice-valued propositional logic LP(X) based on lattice implication algebra is presented, where filter of the truth-value field being a lattice implication algebra is taken as the criterion for measuring the satisfiability of a lattice-valued logical formula. The notions and properties of lattice implication algebra, filter of lattice implication algebra, and the lattice-valued propositional logic LP(X) are given firstly. The definitions and structures of two kinds of lattice-valued logical formulae, i.e., the simple generalized clauses and complex generalized clauses, are presented then. Finally, the filter-based resolution principle is given and after that the soundness theorem and weak completeness theorems for the presented approach are proved.     

谓词模态逻辑到对应物理论的翻译

对应物理论(counterpart theory)是一阶逻辑的一种理论.Lewis利用谓词模态逻辑到对应物理论的翻译来研究谓词模态逻辑的性质,但是Lewis的翻译存在把不可满足的公式翻译为可满足公式的情况针对这个问题,提出了一种扩展语义的谓词模态逻辑,建立了扩展语义后谓词模态逻辑模型与对应物理论模型的一一对应关系,并在此基础上建立了谓词模态逻辑到对应物理论的语义忠实语义满翻译(faithful and full translation),其可确保将谓词模态逻辑的可满足公式和不可满足公式分别翻译为对应物理论的可满足公式和不可满足公式.由对应物理论是可靠的、完备的一阶逻辑的理论且语义忠实语义满翻译保持可靠性和完备性,进一步证明了扩展语义的谓词模态逻辑也是可靠和完备的.