The starting point of the paper is the (well-known)observation that the “classical” Rough Set Theory as introduced by PAWLAK is equivalent to the S5 Propositional Modal Logic where the reachability relation is an equivalence relation. By replacing this equivalence relation by an arbitrary binary relation (satisfying certain properties, for instance, reflexivity and transitivity) we shall obtain...

ur aim of this  paper  is  to introduce the concept of $L$-double fuzzy rough sets in whichboth constructive and axiomatic approaches are used. In constructive approach, a pairof $L$-double fuzzy lower (resp. upper) approximation operators is defined  and the basic properties of them  are studied.From the viewpoint of the axiomatic approach, a set of axioms is constructed to characterize the $L...

Given the sensitivity of current ground-based Gravitational Wave (GW) detectors, any continuous-wave signal we can realistically expect will be at a level or below the background noise. Hence, any data analysis of detector data will need to rely on statistical techniques to separate the signal from the noise. While with the current sensitivity of our detectors we do not expect to detect any tru...

In a fuzzy topology on a set X, the limit of a prefilter (i.e. a filter in the lattice [0,i] X) is calculated from the fuzzy closure. In this way convergence is derived from a fuzzy topology. In our paper we start with any rule "lira" which to any prefilter on X assigns, a function lira E [0,i] X. We give necessary and sufficient conditions for the function lim in order that it can be derived f...

An interpretation of intuitionistic fuzzy sets is proposed based on random set theory and prototype theory. The extension of fuzzy labels are modelled by lower and upper random set neighbourhoods, identifying those element of the universe within an uncertain distance threshold of a set of prototypical elements. These neighbourhoods are then generalised to compound fuzzy descriptions generated a...

A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...

This paper describes the development of a fuzzy decision support system (FDSS) for the assessment of risk in E-commerce (EC) development. A Web-based prototype FDSS is suggested to assist EC project managers in identifying potential EC risk factors and the corresponding project risks. A risk analysis model for EC development using a fuzzy set approach is proposed and incorporated into the FDSS....