In this paper, we take a GL-quantale as the truth value table to study a new rough set model—L-valued fuzzy rough sets. The three key components of this model are: an L-fuzzy set A as the universal set, an L-valued relation of A and an L-fuzzy set of A (a fuzzy subset of fuzzy sets). Then L-valued fuzzy rough sets are completely characterized via both constructive and axiomatic approaches. 

The problem of finding the digital convex fuzzy hull of a digital fuzzy set, whose support is made of some digital points (centroids) in Z, is considered here. A region is DL−convex if, for any two pixels belonging to it, there exists a digital straight line between them, all of whose pixels belong to the region. An algorithm how to compute the DL−convex hull of a digital region is described. A...

Since its original formulation, the theory of fuzzy sets has spawned a number of extensions where the role of membership values in the real unit interval $[0, 1]$ is handed over to more complex mathematical entities. Amongst the many existing extensions, two similar ones, the fuzzy multisets and the hesitant fuzzy sets, rely on collections of several distinct values to represent fuzzy membershi...

In this work, we shall present some novel process to measure the similarity between picture fuzzy sets. Firstly, we adopt the concept of intuitionistic fuzzy sets, interval-valued intuitionistic fuzzy sets and picture fuzzy sets. Secondly, we develop some similarity measures between picture fuzzy sets, such as, cosine similarity measure, weighted cosine similarity measure, set-theoretic similar...

Anew integral for capacities is introduced and characterized. It differs from the Choquet integral on non-convex capacities. The main feature of the new integral is concavity, whichmight be interpreted as uncertainty aversion. The integral is extended to fuzzy capacities, which assign subjective expected values to random variables (e.g., portfolios) and may assign subjective probability only to...

Core elements (a la Aubin) of a fuzzy game can be associated with additive separable supporting functions of fuzzy games. Generalized cores whose elements consist of more general separable supporting functions of the game are introduced and studied. While the Aubin core of unanimity games can be empty, the generalized core of unanimity games is nonempty. Properties of the generalized cores and ...

we have the crisp vector → PQ= (y(1)−x(1),y(2)−x(2), . . . ,y(n)−x(n)) in a pseudo-fuzzy vector space Fn p (1)= {(a(1),a(2), . . . ,a(n))1∀(a(1),a(2), . . . ,a(n))∈Rn}. There is a one-to-one onto mapping P = (x(1),x(2), . . . ,x(n)) ↔ P̃ = (x(1),x(2), . . . , x)1. Therefore, for the crisp vector → PQ, we can define the fuzzy vector → P̃ Q̃= (y(1)− x(1),y(2)−x(2), . . . ,y(n)−x(n))1 = Q̃ P̃ . Let the...

Fuzzy vectors were introduced as a description of imprecise quantities whose uncertainty originates from vagueness, not from a probabilistic model. Support functions are a classical tool for representation and computation with compact convex sets. The combination of these two techniques—support functions of fuzzy vectors—has been proposed by Puri and Ralescu. Independently, Bobylev proposed ano...

we have the crisp vector → PQ= (y(1)−x(1),y(2)−x(2), . . . ,y(n)−x(n)) in a pseudo-fuzzy vector space Fn p (1)= {(a(1),a(2), . . . ,a(n))1∀(a(1),a(2), . . . ,a(n))∈Rn}. There is a one-to-one onto mapping P = (x(1),x(2), . . . ,x(n)) ↔ P̃ = (x(1),x(2), . . . , x)1. Therefore, for the crisp vector → PQ, we can define the fuzzy vector → P̃ Q̃= (y(1)− x(1),y(2)−x(2), . . . ,y(n)−x(n))1 = Q̃ P̃ . Let the...

We address the problem of identifying a useful set of mutually compatible separation axioms for each category T-FNS of T-neighbourhood spaces. It should contain one of T-complete regularity that characterizes T-uniformizability, as indeed we achieve here. This seems to necessitate the parameterization of most separation axioms by the triangular norm T, with the exception of the two axioms T0 an...