Many real-life applications need to handle and manage time pieces of information. Allen temporal relations are one of the most used and known formalisms for modelling and handling temporal data. This paper discusses a novel idea to introduce some kind of flexibility in defining such relations between two fuzzy time intervals. The key concept of this approach is a fuzzy tolerance relation conven...

Aggregation of fuzzy relations in multicriteria decision making problems is considered. Pair wise comparisons between the alternatives by several criteria are given as fuzzy relations with definite properties. The weighted coefficients of the criteria are fuzzy numbers. The aim is to suggest models for aggregation of the fuzzy relations taking into account the criteria importance. The propertie...

Pawlak’s Rough set theory was originally proposed as a general mathematical tool for dealing with uncertainty in modeling imperfect knowledge. The purpose of this paper is to introduce the concept of multifuzzy rough sets by combining the multi-fuzzy set and rough set models. Some operations such as Complement, Union, Intersection etc. are defined for multi-fuzzy rough sets and De Morgan’s laws...

Galois connection in crisp binary relations has proved to be useful for several applications in computer science. Unfortunately, data is not always presented as a crisp binary relation but may be composed of fuzzy values, thus forming a fuzzy binary relation. This paper aims at defining the notion of fuzzy galois connection corresponding to a fuzzy binary relation in two steps: firstly by defin...

Abstract. A new method is proposed to solve the interactive group decision making problem in which the preference information takes the form of intuitionistic fuzzy preference relations. Firstly, we aggregate all individual intuitionistic fuzzy preference relations into a collective one. Then, a method to determine the experts’ weights by utilizing the compatibility measures of the individual i...

The notion of extensionality of a fuzzy relation w.r.t. a fuzzy equivalence was first introduced by Höhle and Blanchard. Bělohlávek introduced a similar definition of compatibility of a fuzzy relation w.r.t. a fuzzy equality. In [14] we generalized this notion to left compatibility, right compatibility and compatibility of arbitrary fuzzy relations and we characterized them in terms of left and...

Intuitionistic fuzzy rough sets are investigated in a general framework which includes generalizations of many related results in early literatures. A new definition of intuitionistic fuzzy rough sets is given with the analysis of its basic properties based on the notion of two universes, general binary relations, and a pair ðT , IÞ of intuitionistic fuzzy t-norm T and intuitionistic fuzzy impl...

Kernel methods and rough sets are two general pursuits in the domain of machine learning and intelligent systems. Kernel methods map data into a higher dimensional feature space, where the resulting structure of the classification task is linearly separable; while rough sets granulate the universe with the use of relations and employ the induced knowledge granules to approximate arbitrary conce...

Recently, Mishra and Srivastava have introduced studied the notion of fuzzy topology generated by relation several properties were proved. In this paper, we mainly investigate lattice structure open sets in topology, show its various characteristics. Additionally, extend to notions ideal filter. For each these notions, fully characterize them terms meet join operations.

In this paper cores and stable sets for games with fuzzy coalitions are introduced and their relations studied. For convex fuzzy games it turns out that all cores coincide and that the core is the unique stable set. Also relations between cores and stable sets for fuzzy clan games are discussed. MSC: 90D12; 03E72