Fuzzy inference based on families of α-level sets

A fuzzy-inference method in which fuzzy sets are defined by the families of their α-level sets, based on the resolution identity theorem, is proposed. It has the following advantages over conventional methods: (1) it studies the characteristics of fuzzy inference, in particular the input-output relations of fuzzy inference; (2) it provides fast inference operations and requires less memory capacity; (3) it easily interfaces with two-valued logic; and (4) it effectively matches with systems that include fuzzy-set operations based on the extension principle. Fuzzy sets defined by the families of their α-level sets are compared with those defined by membership functions in terms of processing time and required memory capacity in fuzzy logic operations. The fuzzy inference method is then derived, and important propositions of fuzzy-inference operations are proved. Some examples of inference by the proposed method are presented, and fuzzy-inference characteristics and computational efficiency for α-level-set-based fuzzy inference are considered     

Generalizing database relational algebra for the treatment of incomplete or uncertain information and vague queries

This paper deals with relational databases which are extended in the sense that fuzzily known values are allowed for attributes. Precise as well as partial (imprecise, uncertain) knowledge concerning the value of the attributes are represented by means of [0,1]-valued possibility distributions in Zadeh's sense. Thus, we have to manipulate ordinary relations on Cartesian products of sets of fuzzy subsets rather than fuzzy relations. Besides, vague queries whose contents are also represented by possibility distributions can be taken into account. The basic operations of relational algebra, union, intersection, Cartesian product, projection, and selection are extended in order to deal with partial information and vague queries. Approximate equalities and inequalities modeled by fuzzy relations can also be taken into account in the selection operation. Then, the main features of a query language based on the extended relational algebra are presented. An illustrative example is provided. This approach, which enables a very general treatment of relational databases with fuzzy attribute values, makes an extensive use of dual possibility and necessity measures.     

On averaging operators for Atanassov’s intuitionistic fuzzy sets

Atanassov’s intuitionistic fuzzy set (AIFS) is a generalization of a fuzzy set. There are various averaging operators defined for AIFSs. These operators are not consistent with the limiting case of ordinary fuzzy sets, which is undesirable. We show how such averaging operators can be represented by using additive generators of the product triangular norm, which simplifies and extends the existing constructions. We provide two generalizations of the existing methods for other averaging operators. We relate operations on AIFS with operations on interval-valued fuzzy sets. Finally, we propose a new construction method based on the ?ukasiewicz triangular norm, which is consistent with operations on ordinary fuzzy sets, and therefore is a true generalization of such operations.     

The Representation of Fuzzy Knowledge

Abstract

A new AI programming language (called FUZZY) is introduced which provides a number of facilities for efficiently representing and manipulating fuzzy knowledge. A fuzzy associative net is maintained by the system, and procedures with associated “procedure demons” may be defined for the control of fuzzy processes. Such standard AI language features as a pattern-directed data access and procedure invocation mechanism and a backtrack control structure are also available.

This paper examines some general techniques for representing fuzzy knowledge in FUZZY, including the use of the associative net for the explicit representation of fuzzy sets and fuzzy relations, and the use of “deduce procedures” to implicitly define fuzzy sets, logical combinations of fuzzy sets, linguistic hedges, and fuzzy algorithms. The role of inference in a fuzzy environment is also discussed, and a technique for computing fuzzy inferences in FUZZY is examined.

The programming language FUZZY is implemented in LISP, and is currently running on a UNIVAC 1110 computer.     

Generalized fuzzy rough sets determined by a triangular norm

The theory of rough sets has become well established as an approach for uncertainty management in a wide variety of applications. Various fuzzy generalizations of rough approximations have been made over the years. This paper presents a general framework for the study of T-fuzzy rough approximation operators in which both the constructive and axiomatic approaches are used. By using a pair of dual triangular norms in the constructive approach, some definitions of the upper and lower approximation operators of fuzzy sets are proposed and analyzed by means of arbitrary fuzzy relations. The connections between special fuzzy relations and the T-upper and T-lower approximation operators of fuzzy sets are also examined. In the axiomatic approach, an operator-oriented characterization of rough sets is proposed, that is, T-fuzzy approximation operators are defined by axioms. Different axiom sets of T-upper and T-lower fuzzy set-theoretic operators guarantee the existence of different types of fuzzy relations producing the same operators. The independence of axioms characterizing the T-fuzzy rough approximation operators is examined. Then the minimal sets of axioms for the characterization of the T-fuzzy approximation operators are presented. Based on information theory, the entropy of the generalized fuzzy approximation space, which is similar to Shannon’s entropy, is formulated. To measure uncertainty in T-generalized fuzzy rough sets, a notion of fuzziness is introduced. Some basic properties of this measure are examined. For a special triangular norm T = min, it is proved that the measure of fuzziness of the generalized fuzzy rough set is equal to zero if and only if the set is crisp and definable.     

Grouping fuzzy sets by similarity

The paper presents results on factorization of systems of fuzzy sets. The factorization consists in grouping those fuzzy sets which are pairwise similar at least to a prescribed degree a. An obstacle to such factorization, well known in fuzzy set theory, is the fact that “being similar at least to degree a” is not an equivalence relation because, in general, it is not transitive. As a result, ordinary factorization using equivalence classes cannot be used. This obstacle can be overcome by considering maximal blocks of fuzzy sets which are pairwise similar at least to degree a. We show that one can introduce a natural complete lattice structure on the set of all such maximal blocks and study this lattice. This lattice plays the role of a factor structure for the original system of fuzzy sets. Particular examples of our approach include factorization of fuzzy concept lattices and factorization of residuated lattices.     

On characterization of intuitionistic fuzzy rough sets based on intuitionistic fuzzy implicators

This paper presents a general framework for the study of relation-based (I,T)-intuitionistic fuzzy rough sets by using constructive and axiomatic approaches. In the constructive approach, by employing an intuitionistic fuzzy implicator I and an intuitionistic fuzzy triangle norm T, lower and upper approximations of intuitionistic fuzzy sets with respect to an intuitionistic fuzzy approximation space are first defined. Properties of (I,T)-intuitionistic fuzzy rough approximation operators are examined. The connections between special types of intuitionistic fuzzy relations and properties of intuitionistic fuzzy approximation operators are established. In the axiomatic approach, an operator-oriented characterization of (I,T)-intuitionistic fuzzy rough sets is proposed. Different axiom sets characterizing the essential properties of intuitionistic fuzzy approximation operators associated with various intuitionistic fuzzy relations are explored.     

Algorithm and axiomatization of rough fuzzy sets based finite dimensional fuzzy vectors

Rough sets, proposed by Pawlak and rough fuzzy sets proposed by Dubois and Prade were expressed with the different computing formulas that were more complex and not conducive to computer operations. In this paper, we use the composition of a fuzzy matrix and fuzzy vectors in a given non-empty finite universal, constitute an algebraic system composed of finite dimensional fuzzy vectors and discuss some properties of the algebraic system about a basis and operations. We give an effective calculation representation of rough fuzzy sets by the inner and outer products that unify computing of rough sets and rough fuzzy sets with a formula. The basis of the algebraic system play a key role in this paper. We give some essential properties of the lower and upper approximation operators generated by reflexive, symmetric, and transitive fuzzy relations. The reflexive, symmetric, and transitive fuzzy relations are characterized by the basis of the algebraic system. A set of axioms, as the axiomatic approach, has been constructed to characterize the upper approximation of fuzzy sets on the basis of the algebraic system.     

λ-Statistical limit points of the sequences of fuzzy numbers

Aytar has introduced the concepts of statistical limit and cluster points of a sequence of fuzzy numbers based on the definitions given in Fridy’s study for sequences of real numbers. In this paper, we define λ-statistical limit and λ-statistical cluster points of sequences of fuzzy numbers and discuss the relations among the sets of ordinary limit points, λ-statistical limit points and λ-statistical cluster points of sequences of fuzzy numbers.     

Algorithm and axiomatization of rough fuzzy sets based finite dimensional fuzzy vectors

Rough sets, proposed by Pawlak and rough fuzzy sets proposed by Dubois and Prade were expressed with the different computing formulas that were more complex and not conducive to computer operations. In this paper, we use the composition of a fuzzy matrix and fuzzy vectors in a given non-empty finite universal, constitute an algebraic system composed of finite dimensional fuzzy vectors and discuss some properties of the algebraic system about a basis and operations. We give an effective calculation representation of rough fuzzy sets by the inner and outer products that unify computing of rough sets and rough fuzzy sets with a formula. The basis of the algebraic system play a key role in this paper. We give some essential properties of the lower and upper approximation operators generated by reflexive, symmetric, and transitive fuzzy relations. The reflexive, symmetric, and transitive fuzzy relations are characterized by the basis of the algebraic system. A set of axioms, as the axiomatic approach, has been constructed to characterize the upper approximation of fuzzy sets on the basis of the algebraic system.     

On fuzzy complements

Bellman and Giertz [1] showed that under reasonable restrictions the generalized operations of union and intersection for fuzzy sets have to be l.u.b. and g.l.b. in I^x endowed with the usual order, where I denotes the unit interval and X is an arbitrary set. They also remarked that an analogous result for fuzzy complementation was not readily obtainable. It is the purpose of this paper to characterize those operations which are acceptable as complementation. We define a category of fuzzy complemented spaces and see which subcategories have properties analogous to those of the category of sets and functions. We also consider some topological aspects of the matter.     

Free semiring-representations and nondeterminism

Semirings provide a simple abstract model of the syntax for a nondeterministic programming language. Each element of a semiring is a nondeterministic program segment, and the semiring operations (+ and ?) correspond to nondeterministic or and program composition. This is analogous to using an algebraic theory for the abstract syntax of a deterministic language. In the case of algebraic theories, an algebra provides the semantics, and free algebras (which always exist) are particularly important. For a semiring, semantics is provided by a representation as a system of relations. This paper examines the question of when free representations exist. Unlike free algebras, free representations do not always exist. It is shown that a semiring has free representations generated by arbitrary sets of variables iff it has a free representation generated by a single variable. Examples of semirings are given that do not have free representations. However, for an important class of semirings, free representations are always available. This class consists of semirings which arise when nondeterminism is freely added to a deterministic programming language.     

Grey集上的逻辑和运算算子

通过定义单位区间I的全体灰信息域上的偏序关系,给出grey集和grey关系在一个格上的定义。由单位区间上的模糊逻辑和运算算子,依据经典扩张原理构造了定义在Θ（I）上相应的grey算子。由格运算的性质导出grey关系合成运算的表示,依照模糊化算子和判决化算子的定义得出对应的grey算子。讨论有关算子的基本性质并举例说明其应用。通过对grey语义的语言值上一组运算的数学描述,旨在提高信息系统对灰信息的处理能力,将处理范围由模糊语言值拓展到基于gray语义的语言值。     

An introduction to vague complemented ordered sets

The purpose of this paper is to introduce a theory of fuzzily defined complement operations on nonempty sets equipped with fuzzily defined ordering relations. Many-valued equivalence relation-based fuzzy ordering relations (also called vague ordering relations) provide a powerful and a comprehensive mathematical modelling of fuzzily defined partial ordering relations. For this reason, starting with a nonempty set X equipped with a many-valued equivalence relation and a vague ordering relation, a fuzzily defined complement operation (called a vague complement operation) on X will be formulated by means of the underling many-valued equivalence relation and vague ordering relation. Because of the fact that the practical implementations of vague complement operations basically depend on their representation properties, a considerable part of this paper is devoted to the representations of vague complement operations. In addition to this, the present paper provides various nontrivial examples for vague complements, and introduces a many-valued logical interpretation of quantum logic as a real application of vague complements.     

Systemic approach to fuzzy logic formalization for approximate reasoning

L.A. Zadeh, E.H. Mamdani, M. Mizumoto, et al., R.A. Aliev and A. Tserkovny have proposed methods for fuzzy reasoning in which antecedents and consequents involve fuzzy conditional propositions of the form “If x is A then y is B”, with A and B being fuzzy concepts (fuzzy sets). A formulation of fuzzy antecedent/consequent chains is one of the most important topics within a wide spectrum of problems in fuzzy sets in general and approximate reasoning, in particular. From the analysis of relevant research it becomes clear that for this purpose, a so-called fuzzy conditional inference rules comes as a viable alternative. In this study, we present a systemic approach toward fuzzy logic formalization for approximate reasoning. For this reason, we put together some comparative analysis of fuzzy reasoning methods in which antecedents contain a conditional proposition with fuzzy concepts and which are based on implication operators present in various types of fuzzy logic. We also show a process of a formation of the fuzzy logic regarded as an algebraic system closed under all its operations. We examine statistical characteristics of the proposed fuzzy logic. As the matter of practical interest, we construct a set of fuzzy conditional inference rules on the basis of the proposed fuzzy logic. Continuity and stability features of the formalized rules are investigated.     

Compatibility of t-norms with the concept of ?-partition

In this paper we study the behaviour of a kind of partitions formed by fuzzy sets, the ?-partitions, with respect to three important operations: refinement, union and product of partitions. In the crisp set theory, the previous operations lead to new partitions: every refinement of a partition is also a partition; the union of partitions of disjoint sets is a partition of the union set; the product of two partitions of two sets is a partition of the intersection of the partitioned sets. It has been proven that ?-partitions extend the three previous properties when the intersection of fuzzy sets is defined by the minimum t-norm and the union by the maximum t-conorm. In this paper we consider any t-norm defining the intersection of fuzzy sets and we characterize those t-norms for which refinements, unions and products of ?-partitions are ?-partitions. We pay special attention to these characterizations in the case of continuous t-norms.     

Pattern recognition using type-II fuzzy sets

Type II fuzzy sets are a generalization of the ordinary fuzzy sets in which the membership value for each member of the set is itself a fuzzy set in [0,1]. We introduce a similarity measure for measuring the similarity, or compatibility, between two type-II fuzzy sets. With this new similarity measure we show that type-II fuzzy sets provide us with a natural language for formulating classification problems in pattern recognition.     

Spatial Plateau Algebra for implementing fuzzy spatial objects in databases and GIS: Spatial plateau data types and operations

Many geographical applications have to deal with spatial objects that reveal an intrinsically vague or fuzzy nature. A spatial object is fuzzy if locations exist that cannot be assigned completely to the object or to its complement. Spatial database systems and Geographical Information Systems (GIS) are currently unable to cope with this kind of data. Based on an available abstract data model of fuzzy spatial data types for fuzzy points, fuzzy lines, and fuzzy regions that leverages fuzzy set theory and fuzzy point set topology, this article proposes a Spatial Plateau Algebra that provides spatial plateau data types as an implementation of fuzzy spatial data types. Each spatial plateau object consists of a finite number of crisp counterparts that are all adjacent or disjoint to each other, are associated with different membership values, and hence form different plateaus. The formal framework and the implementation are based on well known, exact models and implementations of crisp spatial data types. Spatial plateau operations as geometric operations on spatial plateau objects are expressed as a combination of geometric operations on the underlying crisp spatial objects. This article offers a conceptually clean foundation for implementing a database extension for fuzzy spatial objects and their operations, and demonstrates the embedding of these new data types as attribute data types in a database schema as well as the incorporation of fuzzy spatial operations into a database query language.     

Robustness of fuzzy reasoning via logically equivalence measure

In this paper, we discuss robustness of fuzzy reasoning. After proposing the definition of perturbation of fuzzy sets based on some logic-oriented equivalence measure, we present robustness results for various fuzzy logic connectives, fuzzy implication operators, inference rules and fuzzy reasoning machines, and discuss the relations between the robustness of fuzzy reasoning and that of fuzzy conjunction and implication operators. The robustness results are presented in terms of δ-equalities of fuzzy sets based on some logic-oriented equivalence measure, and the maximum of δ (which ensures the corresponding δ-equality holds) is derived.     

二型直觉模糊集

二型模糊集和直觉模糊集都具有很强的实际应用背景.二型模糊集增强了系统处理不确定性的能力,直觉模糊集为解决人们判断问题所出现的犹豫信息提供了理论依据.本文在二型模糊集和直觉模糊集的基础上,给出了二型直觉模糊集的概念,证明了二型直觉模糊集是一型模糊集、直觉模糊集、区间值模糊集、区间值直觉模糊集的广义形式,讨论了二型直觉模糊集的基本运算和二型直觉模糊关系.最后,研究了基于二型直觉模糊理论的近似推理,并实例说明了二型直觉模糊集的实际应用背景.