Rough membership function defines the degree of relationship between conditional and decision attributes an information system. It is defined by where src=image/13429145_07.gif> subset src=image/13429145_08.gif> under relation src=image/13429145_09.gif> universe discourse. can be expressed in different forms like cardinality form, probabilistic form etc. In it as...

rough sets theory is a mathematical approach for analysis of a vague description of objects presented by a well-known mathematician, pawlak (1982, 1991). this paper explores the use of rough sets theory in site location investigation of buried concrete water reservoirs. making an appropriate decision in site location can always avoid unnecessary expensive costs which is very important in constr...

let $r$ be a commutative ring with identity and $mathbb{a}(r)$ be the set   of ideals of $r$ with non-zero annihilators. in this paper, we first introduce and investigate the principal ideal subgraph of the annihilating-ideal graph of $r$, denoted by $mathbb{ag}_p(r)$. it is a (undirected) graph with vertices $mathbb{a}_p(r)=mathbb{a}(r)cap mathbb{p}(r)setminus {(0)}$, where   $mathbb{p}(r)$ is...

In this paper basic notions of the rough intuitionistic fuzzy set theory will be given. In fact the paper concerns a relationship between rough intuitionistic fuzzy sets and lattice theory. We shall introduce the notion of rough intuitionistic fuzzy lattice (resp rough intuitionistic fuzzy ideals). We also defined intuitionistic fuzzy rough set corresponding to a rough set and given conditions ...

Abstract. This paper extends some essential topological properties in general topological spaces in to the I-rough topological spaces, the topology of the rough universe. I-rough compactness and I-rough Hausdorffness are introduced and several properties are investigated. I-rough compactness of subsets of I-rough Hausdorff spaces are studied. Also the paper establishes I-rough connectedness in ...

Automata theory plays a key role in computational theory as many computational problems can be solved with its help. Formal grammar is a special type of automata designed for linguistic purposes. Formal grammar generates formal languages. Rough grammar and rough languages were introduced to incorporate the imprecision of real languages in formal languages. These languages have limitations on un...

The present paper proposes a novel way to unify Rough Set Theory and Formal Concept Analysis. Our method stems from results insights developed in the algebraic theory of modal logic, is based on idea that Pawlak’s original approximation spaces can be seen as special instances enriched formal contexts, i.e. relational structures formal; contexts