共查询到17条相似文献,搜索用时 156 毫秒
1.
在n值(L)ukasiewicz命题逻辑中提出了命题集T的约简理论,引入由命题集F所诱导的形式背景的概念,从T及其子集的关系出发给出了n值命题逻辑中有限命题集T约简的判定定理以及求T约简的方法.说明了无穷值(L)ukesiewicz命题逻辑中命题集T的约简可转化为n值情形. 相似文献
2.
通过视赋值集为通常乘积拓扑空间,利用其上的Borel概率测度在n值及连续值■ukasiewicz命题逻辑系统中引入了命题的Borel概率真度概念,讨论了它的基本性质,特别是给出了n值情形中概率真度函数的积分表示定理,并得到了其与连续情形概率真度函数之间关系的一个极限定理.结果表明,计量逻辑学中命题的真度概念只是所研究工作的一个特例,因而基于概率真度概念可以为不确定性推理建立一种更为宽泛的计量化模型. 相似文献
3.
李立峰 《计算机工程与应用》2009,45(13):59-61
设Г为有限命题集,首先讨论了Г在不同的n值命题逻辑系统Ln^*中的相容性问题,提出了Г的约简理论,从命题集Г所诱导的多值形式背景出发,运用概念格的方法从Г及其子集的关系出发给出了Г约简的判定定理。 相似文献
4.
李立峰 《计算机工程与应用》2009,45(13):59-61
设Г为有限命题集,首先讨论了Г在不同的n值命题逻辑系统Ln*中的相容性问题,提出了Г的约简理论,从命题集Г所诱导的多值形式背景出发,运用概念格的方法从Г及其子集的关系出发给出了Г约简的判定定理。 相似文献
5.
基于均匀概率空间的无穷乘积,在n值命题逻辑系统MTLn中引入命题的?琢-真度概念,给出了一般真度推理规则;利用命题的α-真度定义了命题间的α-相似度,进而导出命题集上的一种伪距离,使得在n值命题逻辑系统MTLn中展开近似推理成为可能。 相似文献
6.
马垣 《模式识别与人工智能》2013,26(10):935-943
求命题集所有可能的约简是二值命题逻辑的一个重要课题。目前的算法都是逐一求单个约简,汇总起来得到所有可能约简。文中应用形式概念的理论,提出内涵亏值、亏值超图等思想,给出一次即可求出所有约简的算法。该算法使计算全部约简的运算次数大为减少。 相似文献
7.
利用势为3的非均匀概率空间的无穷乘积,在£ukasiewicz三值命题逻辑中引入了公式的概率真度概念,证明了全体公式的概率真度值之集在[0,1]中没有孤立点;利用概率真度定义了概率相似度和伪距离,进而建立了概率逻辑度量空间,证明了该空间中没有孤立点,为三值命题的近似推理理论提供了一种可能的框架。 相似文献
8.
以随机真度为基础,提出了二值命题逻辑中公式的在有限信息Γ限制下的随机真度概念。以此为基础定义了公式的Γ-限制随机相似度和Γ-限制随机伪距离,得到了在有限信息Γ限制下公式到理论结论集的Γ-限制随机伪距离的Γ-限制随机真度表示式,为二值命题逻辑中基于有限信息限制的近似推理的随机化研究提供数值化工具。 相似文献
9.
10.
G?del n值命题逻辑中命题的α-真度理论 总被引:3,自引:0,他引:3
为了在n值命题逻辑系统中建立一种程度化推理机制,并为其提供一个可能的近似推理框架,利用势为n的均匀概率空间的无穷乘积,在n值G?del命题逻辑系统中引入命题的α-真度概念.证明了一般真度推理规则,给出了判定α-重言式的充分必要条件,并利用命题的α-真度定义了命题间的α-相似度,进而导出命题集上的一种伪距离,使得在n值命题逻辑系统中展开近似推理成为可能.提出的程度化推理方法为近似推理的算法实现奠定了基础,并对知识推理的程度化有所启示. 相似文献
11.
The concept of truth degrees of formulas in Łukasiewiczn-valued propositional logicL
n is proposed. A limit theorem is obtained, which says that the truth functionτ
n induced by truth degrees converges to the integrated truth functionτ whenn converges to infinite. Hence this limit theorem builds a bridge between the discrete valued Łukasiewicz logic and the continuous
valued Łukasiewicz logic. Moreover, the results obtained in the present paper is a natural generalization of the corresponding
results obtained in two-valued propositional logic. 相似文献
12.
在n值Lukasiewicz命题逻辑系统中引入了公式集F(S)上真度函数的公理化定义,给出了真度函数的若干重要性质,利用真度函数从形式上定义了相似度和伪距离,建立了逻辑度量空间,为从语构的角度展开近似推理提供了一种可能的框架。 相似文献
13.
By means of infinite product of uniformly distributed probability spaces of cardinal n the concept of truth degrees of propositions in the n-valued generalized Lukasiewicz propositional logic system L n * is introduced in the present paper. It is proved that the set consisting of truth degrees of all formulas is dense in [0, 1], and a general expression of truth degrees of formulas as well as a deduction rule of truth degrees is then obtained. Moreover, similarity degrees among formulas are proposed and a pseudo-metric is defined therefrom on the set of formulas, and hence a possible framework suitable for developing approximate reasoning theory in n-valued generalized Lukasiewicz propositional logic is established. 相似文献
14.
将符号化计算树逻辑中的Shannon展开式做了推广,在n值Łukasiewicz逻辑系统Łn中,研究了由逻辑公式导出的n值McNaughton函数的展开式,给出了m元n值McNaughton函数的准析取范式和准合取范式.在此基础上,给出了m元n值McNaughton函数的计数问题,并在n值Łukasiewicz逻辑系统Łn中,给出了m元逻辑公式的构造方法及其逻辑等价类的计数问题. 相似文献
15.
By means of infinite product of uniformly distributed probability spaces of cardinal n the concept of truth degrees of propositions in the n-valued generalized Lukasiewicz propositional logic system L
n
*
is introduced in the present paper. It is proved that the set consisting of truth degrees of all formulas is dense in [0,
1], and a general expression of truth degrees of formulas as well as a deduction rule of truth degrees is then obtained. Moreover,
similarity degrees among formulas are proposed and a pseudo-metric is defined therefrom on the set of formulas, and hence
a possible framework suitable for developing approximate reasoning theory in n-valued generalized Lukasiewicz propositional logic is established. 相似文献
16.
A. Ciabattoni D. M. Gabbay N. Olivetti 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》1999,2(4):147-156
In this work we perform a proof-theoretical investigation of some logical systems in the neighborhood of substructural, intermediate
and many-valued logics. The common feature of the logics we consider is that they satisfy some weak forms of the excluded-middle
principle. We first propose a cut-free hypersequent calculus for the intermediate logic LQ, obtained by adding the axiom *A∨**A to intuitionistic logic. We then propose cut-free calculi for systems W
n
, obtained by adding the axioms *A∨(A ⊕ ⋯ ⊕ A) (n−1 times) to affine linear logic (without exponential connectives). For n=3, the system W
n
coincides with 3-valued Łukasiewicz logic. For n>3, W
n
is a proper subsystem of n-valued Łukasiewicz logic. Our calculi can be seen as a first step towards the development of uniform cut-free Gentzen calculi
for finite-valued Łukasiewicz logics. 相似文献
17.
M. Ghorani M. M. Zahedi R. Ameri 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2012,16(10):1723-1732
This paper investigates tree automata based on complete residuated lattice valued (referred to as L-valued) logic. First, we define the notions of L-valued set of pure subsystems and L-valued set of strong pure subsystems, as well as, their relation is considered. Also, L-valued n-tuple operator consist of n successors is defined, some of its properties are examined and its relation with pure subsystem is analyzed. Furthermore, we investigate some concepts such as L-valued set of (strong) homomorphisms, L-valued set of (strong) isomorphisms, and L-valued set of admissible relations. Moreover, we discuss bifuzzy topological characterization of L-valued tree automata. Finally, the relations of homomorphisms between the L-valued tree automata to continuous mappings and open mappings is examined. 相似文献