Disturbing Fuzzy Propositional Logic and its Operators

In this paper, the concept of disturbing fuzzy propositional logic is introduced, and the operators of disturbing fuzzy propositions is defined. Then the 1-dimensional truth value of fuzzy logic operators is extended to be two-dimensional operators, which include disturbing fuzzy negation operators, implication operators, “and” and “or” operators and continuous operators. The properties of these logic operators are studied.     

The influence of some fuzzy implication operators on the accuracy of a fuzzy model-Part I

The problem of the influence of fuzzy implication operators and connective also on the accuracy of a fuzzy model of a d.c. series motor is considered. Several typical fuzzy implication operators are used to construct the fuzzy model of a d.c. series motor. A root-mean-square error is adopted as the criterion of the model's adequacy to the real system. The best typical fuzzy relations are selected.     

The influence of some fuzzy implication operators on the accuracy of a fuzzy model-part II

The influence of fuzzy implication operators and the connective Also on the accuracy of a fuzzy model of a d.c. series motor is considered. Some typical fuzzy implication operators are applied to the construction of a fuzzy model of a d.c. series motor. A root-mean-square error is used as the criterion of the fuzzy model's adequacy to the real system. A number of mathematical operations necessary for the implementation of the fuzzy model are used as the criterion by which the fuzzy model's applicability if estimated from the point of view of computing techniques. The best types of fuzzy relations, representing fuzzy models of a real system, are chosen in order to secure the least root-mean-square error with minimal number of mathematical operations necessary for computer implementation.     

模糊推理的变权综合算法及其构造的模糊系统响应能力分析

将变权综合原理应用于模糊推理,提出一种新的模糊推理算法-变权综合推理算法,并给出利用模糊蕴涵算子确定规则变权的方法。证明了由一些正常蕴涵算子如Lukasiewicz蕴涵、Goguen蕴涵、Godel蕴涵、Dubois-Prade蕴涵等确定的变权综合算法是相容的。进一步分析了该变权综合算法构造的模糊系统的响应能力,结果表明:基于这些正常蕴涵算子的变权综合算法构造的模糊系统具有泛逼近性。     

Two fuzzier implication operators in the theory of fuzzy power sets

The theory of fuzzy power sets requires the use of an implication operator acting within the set of values taken by the membership functions of the fuzzy sets. Two such operators and resulting relationships between fuzzy sets are studied here, and the results compared with previous ones obtained with other implication operators.     

Modeling holistic fuzzy implication using co-copulas

Two related aggregation operators called copulas and co-copulas are introduced and various properties are described. The relationship, of these operators to t-norms and t-conorms is noted. Generalizations of these, respectively, called conjunctors and disjunctors, are introduced. We suggest the use of disjunctor operators for modeling the multi-valued implication operator in fuzzy logic. We point out that the selection of operators used in fuzzy logic, in addition to having appropriate pointwise properties, should be holistic, this requires consideration of the nature of the resulting fuzzy set as a whole. Focusing on the protoform of fuzzy modus ponens and looking at the information contained in the inferred fuzzy set we show that the use of co-copulas has some desirable properties. Taking advantage of the fact that the weighted sum of co-copulas is a co-copula we consider the problem of constructing customized implication operators.     

Fuzzy power sets and fuzzy implication operators

The theory of fuzzy power sets, which has hitherto been insufficiently developed, is shown very naturally to require the use of a fuzzy implication operator (Section 1). Six such operators are gathered from the literature on multiple-valued logic (Section 2), and their effects on fuzzy power-set theory are compared throughout the rest of the paper. After certain fundamental definitions of set characteristics (Section 3), the six operators are carried in parallel while working out basic aspects of power-set theory. Among these are the properties of the set-inclusion relation and the set-equivalence relation (Section 4), two distinct concepts of disjointness (Section 5), questions of consistency in the relations between a set and its complement (Section 6), and a very concrete theorem on a difference among the operators with regard to the derivation of crisp conclusions from fuzzy premises (Section 7). Finally (Section 8), emphasis is placed on the dependence of the choice of operators upon the purposes the user has in hand.     

一类具有泛逼近能力的模糊控制器的设计与等效分类

给出一些由模糊蕴涵算子构造的且具有泛逼近能力的模糊控制器。在等效的意义下,它们又可归结为30种,这些模糊控制器可以用于实际的模糊控制系统之中。     

Intuitionistic fuzzy implication operators: Expressions and properties

The expressions of 32 fuzzy coimplication operators(FCO) and 32 intuitionistic fuzzy implication operators(IFIO) are given in this paper. The Co-D-P properties which the FCOs should satisfy are presented. The FCOs and IFIOs’situation of satisfying the properties which they should satisfy, respectively, are discussed in details.     

模糊推理三Ⅰ算法的还原性

模糊推理算法的还原性是判断蕴涵算子与推理方法配合效果的一个重要标准,只有蕴涵算子与推理方法搭配适当,才能使模糊推理有一个好的效果。本文对模糊推理三I算法具备还原性的条件进行了研究。首先,当与蕴涵算子相伴随的三角模为连续三角模时,给出了FM P问题三I算法具有还原性的充要条件;其次,当蕴涵算子为连续的正则蕴涵算子时,给出了FM T问题的三I算法具有还原性的充要条件;最后,当正则蕴涵算子关于补运算满足对合律时,给出了FM T问题三I算法满足还原性的一个充分条件。     

具有函数的泛逼近性能的模糊控制器的设计

构造出9类具有函数的泛逼近性能的模糊控制器,这些模糊控制器均由模糊蕴涵算子构造而成.利用倒车仿真说明采用具有函数的泛逼近性能的模糊控制器可以用于实际的模糊控制系统中.     

基于格蕴涵代数的模糊幂集

模糊幂集理论依赖于相应的模糊算子的选取,本文通过格蕴涵代数中的蕴涵算子讨论了L—型模糊集的幂集,为高阶格值逻辑的研究作了必要的准备。     

A new class of fuzzy implications. Axioms of fuzzy implication revisited

Many different fuzzy implication operators have been proposed; most of them fit into one of the two classes: implication operations that are based on an explicit representation of implication A → B in terms of &, , and ¬ (e.g., S-implications that are based on the formula B ¬ A), and R-implications that are based on an implicit representation of implication A → B as the weakest C for which C&B implies A. However, some fuzzy implication operations (such as b^a) cannot be naturally represented in this form. To describe such operations, we propose a new (third) class of implication operations called A-implications whose relation to &, , and ¬ is described by (implicit) axioms.     

Theoretical methods of constructing fuzzy inference relations

In this paper, a theoretical method is presented to select fuzzy implication operators for the fuzzy inference sentence “if x is A, then y is B”. By applying representation theorems, thirty-two fuzzy implication operators are obtained. It is shown that the obtained operators are generalizations of classical inference rule A → B, A ^c → B, A → B ^c and A ^c → B ^c respectively and can be divided into four classes. By discussion, it is found that thirty of them among 420 fuzzy implication operators presented by Li can be derived by applying representation theorems and another two new ones are obtained by the use of our methods.     

一些模糊推理方法的还原性

给出15个常用模糊蕴涵算子的三Ⅰ算法,在此基础上讨论由这15个蕴涵算子与CRI算法和三Ⅰ算法相结合生成的30种模糊推理方法的还原性。     

Pythagorean三角模糊语言Hamacher集结算子及其应用

在Pythagorean模糊集和Hamacher集结算子基础上,研究了Pythagorean三角模糊语言环境下的Hamacher集成算子问题。首先给出了Pythagorean三角模糊语言的定义、运算规则、得分函数、精确函数;其次,介绍了一系列关于Pythagorean三角模糊语言Hamacher集结算子,比如Pythagorean三角模糊语言Hamacher加权平均算子(PTrFLHWA)、Pythagorean三角模糊语言Hamacher加权几何平均算子(PTrFLHWG)等,并研究其具有的性质;之后,提出了两种决策方法来解决Pythagorean三角模糊语言信息环境下的多属性群决策问题;最后,用示例验证所给方法的有效性。     

Multi-criteria decision-making methods based on intuitionistic fuzzy sets

In this paper we present new methods for solving multi-criteria decision-making problem in an intuitionistic fuzzy environment. First, we define an evaluation function for the decision-making problem to measure the degrees to which alternatives satisfy and do not satisfy the decision-maker’s requirement. Then, we introduce and discuss the concept of intuitionistic fuzzy point operators. By using the intuitionistic fuzzy point operators, we can reduce the degree of uncertainty of the elements in a universe corresponding to an intuitionistic fuzzy set. Furthermore, a series of new score functions are defined for multi-criteria decision-making problem based on the intuitionistic fuzzy point operators and the evaluation function and their effectiveness and advantage are illustrated by examples.     

梯形直觉模糊数集成算子及在决策中的应用研究

在直觉模糊集理论基础上,用梯形模糊数表示直觉模糊数的隶属度和非隶属度,进而提出了梯形直觉模糊数;然后定义了梯形直觉模糊数的运算法则,给出了相应的证明,并基于这些法则,给出了梯形直觉模糊加权算数平均算子(TIFWAA)、梯形直觉模糊数的加权二次平均算子(TIFWQA)、梯形直觉模糊数的有序加权二次平均算子(TIFOWQA)、梯形直觉模糊数的混合加权二次平均算子(TIFHQA)并研究了这些算子的性质;建立了不确定语言变量与梯形直觉模糊数的转化关系,并证明了转化的合理性;定义了梯形直觉模糊数的得分函数和精确函数,给出了梯形直觉模糊数大小比较方法;最后提供了一种基于梯形直觉模糊信息的决策方法,并通过实例结果证明了该方法的有效性。     

Fuzzy implication operators for difference operations for fuzzy sets and cardinality-based measures of comparison

In this paper, we determine by means of fuzzy implication operators, two classes of difference operations for fuzzy sets and two classes of symmetric difference operations for fuzzy sets which preserve properties of the classical difference operation for crisp sets and the classical symmetric difference operation for crisp sets respectively. The obtained operations allow us to construct as in [B. De Baets, H. De Meyer, Transitivity-preserving fuzzification schemes for cardinality-based similarity measures, European Journal of Operational Research 160 (2005) 726–740], cardinality-based similarity measures which are reflexive, symmetric and transitive fuzzy relations and, to propose two classes of distances (metrics) which are fuzzy versions of the well-known distance of cardinality of the symmetric difference of crisp sets.     

Formal systems of fuzzy logic and their fragments

Formal systems of fuzzy logic (including the well-known Łukasiewicz and Gödel–Dummett infinite-valued logics) are well-established logical systems and respected members of the broad family of the so-called substructural logics closely related to the famous logic BCK. The study of fragments of logical systems is an important issue of research in any class of non-classical logics. Here we study the fragments of nine prominent fuzzy logics to all sublanguages containing implication. However, the results achieved in the paper for those nine logics are usually corollaries of theorems with much wider scope of applicability. In particular, we show how many of these fragments are really distinct and we find axiomatic systems for most of them. In fact, we construct strongly separable axiomatic systems for eight of our nine logics. We also fully answer the question for which of the studied fragments the corresponding class of algebras forms a variety. Finally, we solve the problem how to axiomatize predicate versions of logics without the lattice disjunction (an essential connective in the usual axiomatic system of fuzzy predicate logics).