直觉模糊逻辑的语义算子研究

首先引用Atanassov直觉模糊集的基本概念和运算。在阐明直觉模糊集的集中、扩张、归一化算子之后，新定义了强化算子。通过考察Atanassov直觉模糊集与Zadeh模糊集之间的关系，给出了直觉模糊语言、结构化直觉模糊语言和直觉模糊语义的数学描述，重点对基于直觉模糊集和直觉模糊关系的模糊语言的语义算子，如语气算子、模糊化算子、判定化算子及连接与否定算子等进行了研究，并举例阐明其应用，使直觉模糊逻辑的语义算子得到进一步的拓广。     

一种双线性快速模糊增强图像边界检测最新算法*

在广义模糊集理论的基础上,给出了全新的用于模糊增强图像区域对比度的线性广义模糊算子,从而提出了一种双线性快速模糊增强图像边界检测最新算法。利用线性左半梯形模糊分布将灰度图像的普通空间集合变换为广义模糊空间集合,再利用LGFO对广义模糊集合进行区域对比度增强,把增强后的广义模糊集合变换为普通集合,最后对处理后的普通集合进行边界提取。实例表明该算法提取图像边界速度快、效果好。     

加权犹豫模糊集的群决策方法

对于犹豫模糊元中的不同隶属度值赋予不同的权重,由此构造出一种应用范围更广、更符合实际需要的犹豫模糊集合 ----- 加权犹豫模糊集合.针对加权犹豫模糊集中的加权犹豫模糊元,定义了加权犹豫模糊集合和加权犹豫模糊元的并、交、余、数乘和幂等运算及其运算法则,并讨论它们的运算性质;同时,给出加权犹豫模糊元的得分函数和离散函数,进而给出一种比较加权犹豫模糊元的排序法则.在此基础上,提出两类集成算子:加权犹豫模糊元的加权算术平均算子和加权犹豫模糊元的加权几何平均算子,并针对专家权重(已知和未知)的两种情形,将加权犹豫模糊集合应用于群决策,给出两种基于加权犹豫模糊集合的群决策方法.最后,通过一个应用实例表明所提出的群决策方法的有效性和实用性.     

基于GFS的双线性快速模糊增强图像边界检测新算法

根据广义模糊集(GFS)理论，给出了用于模糊增强图像区域对比度的线性广义模糊算子(LGFO)，从而给出了基于GFS的双线性快速模糊增强图像边界检测新算法。首先利用线性左半梯形隶属函数将灰度图像的普通集合变换为GFS，其次利用LGFO对GFS进行区域对比度增强，同时把GFS变换为模糊集合，然后再把模糊集合变换成普通集合，最后在普通集合中进行边界提取。通过大量实例证明，使用该算法提取图像边界速度快、效果好，而且多项指标均超过了献[2]～[5]。     

直觉模糊集时态逻辑算子及扩展运算性质

首先在考察Atanassov直觉模糊集的基本运算的基础上．引入两个典型的作用于直觉模糊集的时态逻辑算子“□(always)”和“◇(sometimes)”,重点研究了直觉模糊集在直觉模糊时态逻辑算子作用下的若干扩展运算及其性质。最后,将这些运算性质归结为一组定理,并给出详细的证明过程。     

基于三角Pythagorean模糊集的多准则决策方法

Pythagorean模糊集在直觉模糊集的基础上扩大了适用范围,三角模糊数在决策过程中可以保留决策者较多的不确定信息.鉴于此,首先提出三角Pythagorean模糊集的定义及其欧氏距离表示;然后定义三角Pythagorean模糊加权平均(TPFWA)算子、广义三角Pythagorean模糊加权平均(GTPFWA)算子、三角Pythagorean模糊加权几何(TPFWG)算子和广义三角Pythagorean模糊加权几何(GTPFWG)算子,并对算子所满足的幂等性、有界性和单调性予以证明;最后通过一个医药代表选择的多准则决策问题和灵敏度分析验证所提出算子的合理性和有效性.     

P-模糊集(AF,AF)及其应用

把动态特性引入到有限普通集合X内,改进了普通集合X,提出了P-集合(packet sets) ; P-集合是由内P集合XF (internal packet set XF)与外P集合XF (outer packet set XF)构成的集合对;或者(XF,XF)是P集合。P-集合具有动态特性:内P-集合具有内一动态特性,外P集合具有外一动态特性。把P集合(XF,XF)引入到L. A. Zadeh模糊集A中,改进L. A. Zadeh模糊集A,提出P模糊集(packet fuzzy sets). P-模糊集是由内P模糊集AF (internal packet fuzzy sctAF)与外P模糊集AF (outer packet fuzzy set AF)构成的模糊集合对,或者(AF'AF)是P模糊集。P模糊集具有动态特性,给出了P模糊集的若干特征与应用。在一定条件下,P模糊集(AF, AF)能够回到L.A. Zadch模糊集A的“原点”。P模糊集比L. A. Zadeh模糊集具有更大的应用空间。P模糊集是模糊集理论与应用中的一个新的研究方向。     

逻辑系统中的拟对偶性与拟排中律

在经典逻辑和t-模基础逻辑中提出了排中律与拟排中律的新概念,说明经典逻辑(带对偶非的MTL)满足排中律(拟排中律),证明了Go?del模糊逻辑(Lukasiewicz(简称Luk)模糊逻辑)关于最小算子ù与最大算子(关于t-模与t-余模对补算子c)既不满足拟对偶性也不满足拟排中律,检验了Luk模糊逻辑关于Lukt-模与Lukt-余模对?算子满足拟对偶性和排中律。     

基于直觉模糊集改进算子的多目标决策方法

定义了三角和区间直觉模糊集的一些运算法则,给出了直觉模糊集两个改进算子,即三角模糊数加权算术平均算子（FIFWAA） 和区间直觉模糊数加权几何平均算子（FIFWGA）。在此基础上, 提出用精确函数解决记分函数无法决策的问题,以保证记分函数的严密性与合理性。给出了一种属性权重不完全确定且属性值以三角和区间直觉模糊数给出的多目标决策方法,通过实例分析结果证明了运用直觉模糊集改进算子进行多目标决策方法的有效性和正确性。     

模糊数直觉模糊几何集成算子及其在决策中的应用

模糊数直觉模糊集是直觉模糊集的拓展.针对模糊数直觉模糊信息的集成问题,定义了模糊数直觉模糊数的一些运算法则,基于这些法则给出了一些新的几何集成算子,即模糊数直觉模糊加权几何(FIFWG)算子、模糊数直觉模糊有序加权几何(FIFOWG)算子和模糊数直觉模糊混合几何(FIFHG)算子.在此基础上,提出一种属性权重确知且属性值以模糊数直觉模糊数形式给出的多属性群决策方法.最后通过实例分析结果证明了该方法的有效性.     

基于模糊等价的毕达哥拉斯模糊集相似度构造方法

毕达哥拉斯模糊集是Zadeh模糊集的一种推广形式,其相似度刻画方法是毕达哥拉斯模糊集理论的重要研究内容。现有的毕达哥拉斯模糊集相似度大多针对具体问题而提出。为推广毕达哥拉斯模糊集理论的应用范围,文中基于模糊等价研究毕达哥拉斯模糊集相似度的一般构造方法。将模糊等价概念推广至毕达哥拉斯模糊数,提出了PFN(Pythagorean Fuzzy Number)模糊等价的概念,并给出了PFN模糊等价的构造方法。进一步,通过聚合算子给出了基于PFN模糊等价的毕达哥拉斯模糊集相似度的一般构造方法。通过实例说明了现有的一些相似度是文中构造的相似度的特例。     

Generation of interval‐valued fuzzy and atanassov's intuitionistic fuzzy connectives from fuzzy connectives and from Kα operators: Laws for conjunctions and disjunctions,amplitude

In this paper, we study in‐depth certain properties of interval‐valued fuzzy sets and Atanassov's intuitionistic fuzzy sets (A‐IFSs). In particular, we study the manner in which to construct different interval‐valued fuzzy connectives (or Atanassov's intuitionistic fuzzy connectives) starting from an operator. We further study the law of contradiction and the law of excluded middle for these sets. Furthermore, we analyze the following properties: idempotency, absorption, and distributiveness. We conclude relating idempotency with the capacity that some of the connectives studied have for maintaining, in certain conditions, the amplitude (or Atanassov's intuitionistic index) of the intervals on which they act. © 2008 Wiley Periodicals, Inc.     

Normal forms of fuzzy middle and fuzzy contradictions

The expressions of "excluded middle" and "crisp contradiction" are reexamined starting with their original linguistic expressions which are first restated in propositional and then predicate forms. It is shown that, in order to generalize the truth tables and hence the normal forms, the membership assignments in predicate expressions must be separated from their truth qualification. In two-valued logic, there is no need to separate them from each other due to reductionist Aristotalean dichotomy. Whereas, in infinite (fuzzy) valued set and logic, the separation of membership assignments from their truth qualification forms the bases of a new reconstruction of the truth tables. The results obtained from these extended truth tables are reducible to their Boolean equivalents under the axioms of Boolean theory. Whereas, in fuzzy set and logic theory, we obtain a richer and more complex interpretations of the "fuzzy middle" and "fuzzy contradiction."     

Roughness based on fuzzy ideals

The theory of rough set, proposed by Pawlak and the theory of fuzzy set, proposed by Zadeh are complementary generalizations of classical set theory. Many sets are naturally endowed with two binary operations: addition and multiplication. One concept which does this is a ring. This paper concerns a relationship between rough sets, fuzzy sets and ring theory. It is a continuation of ideas presented by Kuroki and Wang [N. Kuroki, P.P. Wang, The lower and upper approximations in a fuzzy group, Inform. Sci. 90 (1996) 203-220]. We consider a ring as a universal set and we assume that the knowledge about objects is restricted by a fuzzy ideal. In fact, we apply the notion of fuzzy ideal of a ring for definitions of the lower and upper approximations in a ring. Some characterizations of the above approximations are made and some examples are presented.     

A novel approach to fuzzy rough sets based on a fuzzy covering

This paper proposes an approach to fuzzy rough sets in the framework of lattice theory. The new model for fuzzy rough sets is based on the concepts of both fuzzy covering and binary fuzzy logical operators (fuzzy conjunction and fuzzy implication). The conjunction and implication are connected by using the complete lattice-based adjunction theory. With this theory, fuzzy rough approximation operators are generalized and fundamental properties of these operators are investigated. Particularly, comparative studies of the generalized fuzzy rough sets to the classical fuzzy rough sets and Pawlak rough set are carried out. It is shown that the generalized fuzzy rough sets are an extension of the classical fuzzy rough sets as well as a fuzzification of the Pawlak rough set within the framework of complete lattices. A link between the generalized fuzzy rough approximation operators and fundamental morphological operators is presented in a translation-invariant additive group.     

Characterization of rough set approximations in Atanassov intuitionistic fuzzy set theory

The primitive notions in rough set theory are lower and upper approximation operators defined by a fixed binary relation and satisfying many interesting properties. Many types of generalized rough set models have been proposed in the literature. This paper discusses the rough approximations of Atanassov intuitionistic fuzzy sets in crisp and fuzzy approximation spaces in which both constructive and axiomatic approaches are used. In the constructive approach, concepts of rough intuitionistic fuzzy sets and intuitionistic fuzzy rough sets are defined, properties of rough intuitionistic fuzzy approximation operators and intuitionistic fuzzy rough approximation operators are examined. Different classes of rough intuitionistic fuzzy set algebras and intuitionistic fuzzy rough set algebras are obtained from different types of fuzzy relations. In the axiomatic approach, an operator-oriented characterization of rough sets is proposed, that is, rough intuitionistic fuzzy approximation operators and intuitionistic fuzzy rough approximation operators are defined by axioms. Different axiom sets of upper and lower intuitionistic fuzzy set-theoretic operators guarantee the existence of different types of crisp/fuzzy relations which produce the same operators.     

两类模糊推理算法的连续性和逼近性

对Zadeh的模糊推理合成法则(CRI算法)和全蕴涵三I算法(三I算法)是否满足连续性和逼近性问题进行了细致的研究,进一步讨论了这两类算法对逼近误差的传播性能.为此,把模糊推理算法看成是模糊集合到模糊集合的映射,选用海明距离作为两模糊集的距离.证明了在模糊假言推理和模糊拒取式推理情形,这两类算法都拥有连续性.指出三I算法在已知规则的前件和后件是正规集的条件下总是满足逼近性,而CRI算法只有当它满足还原性时才拥有逼近性.在满足逼近性的条件下,两类算法都不会放大逼近误差.结果对构建模糊控制系统和模糊专家系统时选用和分析模糊推理算法有一定的指导作用.     

直觉模糊神经网络的函数逼近能力

运用直觉模糊集理论,建立了自适应神经-直觉模糊推理系统（ANIFIS）的控制模型,并证明了该模型具有全局逼近性质.首先将Zadeh模糊推理神经网络变为直觉模糊推理网络,建立一个多输入单输出的T-S型ANIFIS模型;然后设计了系统变量的属性函数和推理规则,确定了各层的输入输出计算关系,以及系统输出结果的合成计算表达式;最后通过证明所建模型的输出结果计算式满足Stone-Weirstrass定理的3个假设条件,完成了该模型的全局逼近性证明.     

粗糙模糊集的构造与公理化方法

用构造性方法和公理化研究了粗糙模糊集．由一个一般的二元经典关系出发构造性地定义了一对对偶的粗糙模糊近似算子，讨论了粗糙模糊近似算子的性质，并且由各种类型的二元关系通过构造得到了各种类型的粗糙模糊集代数．在公理化方法中，用公理形式定义了粗糙模糊近似算子，各种类型的粗糙模糊集代数可以被各种不同的公理集所刻画．阐明了近似算子的公理集可以保证找到相应的二元经典关系，使得由关系通过构造性方法定义的粗糙模糊近似算子恰好就是用公理化定义的近似算子。