Intuitionistic fuzzy linguistic numbers (IFLNs) are an extension of the linguistic variables and the intuitionistic fuzzy sets, which are proposed by Wang and Li (Wang J.Q., Li J.J. (2009) The multi-criteria group decision making method based on multi-granularity intuitionistic two semantics. Science & Technology Information (33), 8-9.). In this paper, we introduced some operational laws of IFL...

Each relation induces a new closure operator, which is (in the sense of data mining) stronger than or equal to the Galois one. The goal is to give some evidence that the new closure operator is often properly stronger than the Galois one. An easy characterization of the new closure operator as a largest fixed point of an appropriate contraction map leads to a (modest) computer program. Finally,...

The paper sets forth in detail categorically-algebraic or catalg foundations for the operations of taking the image and preimage of (fuzzy) sets called forward and backward powerset operators. Motivated by an open question of S. E. Rodabaugh, we construct a monad on the category of sets, the algebras of which generate the fixed-basis forward powerset operator of L. A. Zadeh. On the next step, w...

A pair (X, ) of a finite set X and a closure operator : 2X → 2X is called a closure space. The class of closure spaces includes matroids as well as antimatroids. Associated with a closure space (X, ), the extreme point operator ex: 2X → 2X is defined as ex(A) = {p|p ∈ A,p / ∈ (A − {p})}. We give characterizations of extreme point operators of closure spaces, matroids and antimatroids, respectiv...

In this paper, we present equivalent characterizations of L-closure systems on lower bounded complete L-ordered sets and complete L-lattices, respectively. These results demonstrate the feasibility of notion of fuzzy closure system developed in our previous work (L.-K. Guo, G.-Q. Zhang, Q.-G. Li: Fuzzy closure systems on L-ordered sets. Math. Log. Quart. 57 (3) (2011), 281-291.). Also we develo...

In this paper we study subsystems, reverse subsystems and double subsystems of a fuzzy transition system. We characterize them in terms of fuzzy relation inequalities and equations, as eigen fuzzy sets of the fuzzy quasi-order Qδ and the fuzzy equivalence Eδ generated by fuzzy transition relations, and as linear combinations of aftersets and foresets of Qδ and equivalence classes of Eδ. We also...

In this paper, we present a new method for fuzzy query processing for document retrieval based on extended fuzzy concept networks. In an extended fuzzy concept network, there are four kinds of fuzzy relationships between concepts, i.e., fuzzy positive association, fuzzy negative association, fuzzy generalization, and fuzzy specialization. An extended fuzzy concept network can be modeled by a re...

This paper focuses on the basic operations of Chomsky’s languages. The validity and the effectiveness of some closure operations, such as union operator, product operator and Kleene Closure operator, are discussed in detail. The crosstalk problems in Context-Sensitive Languages (CSL) and Phrase Structure Languages (PSL) are analyzed, and a valuable method to solve this problem is presented by s...

in this work, we define a fuzzy soft set theory and its related properties. we then define fuzzy soft aggregation operator that allows constructing more efficient decision making method. finally, we give an example which shows that the method can be successfully applied to many problems that contain uncertainties.