Results 261 to 270 of about 5,204,108 (294)
Some of the next articles are maybe not open access.
1994
It is shown that the modal system S5 captures the basic propositional aspects of rough set theory. The system S5 is enhanced to define a consequence relation called ‘rough consequence’ to ensure derivability of ‘roughly equal’ formulae. A predicate logic that includes in its ambit all the existing notions of rough set theory, is presented.
Mohua Banerjee, Mihir K. Chakraborty
openaire +2 more sources
It is shown that the modal system S5 captures the basic propositional aspects of rough set theory. The system S5 is enhanced to define a consequence relation called ‘rough consequence’ to ensure derivability of ‘roughly equal’ formulae. A predicate logic that includes in its ambit all the existing notions of rough set theory, is presented.
Mohua Banerjee, Mihir K. Chakraborty
openaire +2 more sources
Information Sciences
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qingzhao Kong, Conghao Yan, Weihua Xu
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qingzhao Kong, Conghao Yan, Weihua Xu
openaire +3 more sources
On Rough Equalities and Rough Equivalences of Sets
2008The different types of rough equalities [4,5,6] of sets deal with approximate equalities of sets which may not be equal in the usual sense of classical set theory. In this article, we make further study of the properties of rough equalities. A more general kind of equality of sets (we call it rough equivalence) shall be introduced, which captures ...
Bala Krushna Tripathy +2 more
openaire +1 more source
2005
This article presents some general remarks on rough sets and their place in general picture of research on vagueness and uncertainty – concepts of utmost interest, for many years, for philosophers, mathematicians, logicians and recently also for computer scientists and engineers particularly those working in such areas as AI, computational intelligence,
openaire +1 more source
This article presents some general remarks on rough sets and their place in general picture of research on vagueness and uncertainty – concepts of utmost interest, for many years, for philosophers, mathematicians, logicians and recently also for computer scientists and engineers particularly those working in such areas as AI, computational intelligence,
openaire +1 more source
2007
This paper is devoted to the discussion of extended covering rough set models. Based on the notion of neighborhood, five pairs of dual covering approximation operators were defined with their properties being discussed. The relationships among these operators were investigated.
Keyun Qin, Yan Gao, Zheng Pei 0001
openaire +2 more sources
This paper is devoted to the discussion of extended covering rough set models. Based on the notion of neighborhood, five pairs of dual covering approximation operators were defined with their properties being discussed. The relationships among these operators were investigated.
Keyun Qin, Yan Gao, Zheng Pei 0001
openaire +2 more sources
The connections of vague set and rough set
Kybernetes, 2012PurposeThe purpose of this paper is to present research methods in processing uncertain information.Design/methodology/approachVague set and rough set are both‐wings‐mode for expressing uncertainty systems, and based on the both‐wings‐mode of expressing uncertainty systems, the connections of vague set and rough set are discussed.FindingsThis paper ...
Ruixia Yan +2 more
openaire +2 more sources
A Semantical Approach to Rough Sets and Dominance-Based Rough Sets
2016There exist two formulations of rough sets: the conceptual and computational one. The conceptual or semantical approach of rough set theory focuses on the meaning and interpretation of concepts, while algorithms to compute those concepts are studied in the computational formulation. However, the research on the former is rather limited.
Lynn D'eer, Chris Cornelis, Yiyu Yao
openaire +2 more sources
Rough Sets in Partially Ordered Sets
2010 IEEE International Conference on Granular Computing, 2010It is well-known to us that the Pawlak’s rough set theory, an effective tool to deal with uncertainty and granularity in information systems, is based on equivalence relation. However, in some situations, those conditions of equivalence relation are hardly met.
Kai Li, William Zhu 0001, Jianguo Tang
openaire +2 more sources
Probabilistic Rough Sets Characterized by Fuzzy Sets
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2004Theories of fuzzy sets and rough sets have emerged as two major mathematical approaches for managing uncertainty that arises from inexact, noisy, or incomplete information. They are generalizations of classical set theory for modelling vagueness and uncertainty.
Li-Li Wei, Wen-Xiu Zhang
openaire +3 more sources
Covering Based Rough Sets and Relation Based Rough Sets
2014Relation based rough sets and covering based rough sets are two important extensions of the classical rough sets. This paper investigates relationships between relation based rough sets and the covering based rough sets in a particular framework of approximation operators, presents a new group of approximation operators obtained by combining coverings ...
Mauricio Restrepo, Jonatan Gómez
openaire +2 more sources