Rough set is a new approach to uncertainties in spatial analysis. In this paper, we complete three works under the umbrella of rough space. First, a set of simplified rough symbols is extended on the basis of existing rough symbols. It is in terms of rough interpretation and specialized indication. Second, rough spatial entity is proposed to study the real world as it is, without forcing uncert...

In recent years many Fuzzy Description Logics (FDLs) based on infinite t-norms have been proved to be undecidable. On the other hand, several FDLs based on finite t-norms, not only have been proved to be decidable, but they have been proved to belong to the same complexity classes as the corresponding crisp DLs. In light of such results, a question that naturally arises is whether the finite-va...

In previous studies we first concentrated on utilizing crisp simulationto produce discrete event fuzzy systems simulations. Then we extendedthis research to the simulation of continuous fuzzy systems models. In this paperwe continue our study of continuous fuzzy systems using crisp continuoussimulation. Consider a crisp continuous system whose evolution depends ondifferential equations. Such a ...

Remark 1 In this text, we always work between 0 and 1 with 1/2 playing the rôle of the midpoint. A simple rescaling allows to work between −1 and 1 with 0 playing the rôle of a midpoint. • A valued relation T is said to be reflexive if T (x, x) = 1, for all x ∈ X. A valued relation T on X such that T (x, y) ∈ {0, 1}, for all x, y ∈ X, is said to be crisp. As is usual, we write x T y instead of ...

In Description Logic (DL) knowledge bases (KBs) information is typically captured by crisp concepts. For many applications, querying the KB by crisp query concepts is too restrictive. A controlled way of gradually relaxing a query concept can be achieved by the use of concept similarity measures. In this paper we formalize the task of instance query answering for crisp DL KBs using concepts rel...

In Description Logics (DL) knowledge bases (KBs) information is typically captured by crisp concept descriptions. However, for many practical applications querying the KB by crisp concepts is too restrictive. A controlled way of gradually relaxing a query concept can be achieved by the use of similarity measures. To this end we formalize the task of instance query answering for crisp DL KBs usi...

In paper the fuzzy linear system d x C x A ~ ~ ~   where A and C are crisp matrices and n m  d~ is a LR fuzzy numbers vector, is investigated in detail. We generalize the definition and arithmetic operations of LR fuzzy numbers and convert the dual fuzzy linear system to two crisp systems of linear equations. Then the minimal fuzzy solution of the original fuzzy system is obtained by solving...

Since the surveys described in our last report (Crisp, 1958) on the distribution in north-west Europe of the immigrant Australasian barnacle, Elminius modestus Darwin, the species has become much commoner along the western coasts and has finally spread to Ireland (Beard, 1957). In this report we present the results of surveys made in 1958-9 along the eastern side of the Irish Channel and in the...

The deserts of the world are hottest places, very less rainfall, almost clear skies throughout the year. These deserts receive highest direct normal irradiance which is most suitable for concentrating solar power plants. With the technological developments and their innovations in concentrating solar power, thermal storage and hybridization/ back up, the sunniest countries expects that CSP shou...

We use a combination of three techniques for the speciication of processes, data and time: CSP, Object-Z and Duration Calculus. Whereas the combination of CSP and Object-Z is well established by the work of C. Fischer 2, 3], the integration with Duration Calculus is new. The combination is used to specify parts of a novel case study on radio controlled railway crossings.