Variable precision rough set model
Journal of Computer and System Sciences
Advances in the Dempster-Shafer theory of evidence
Rough set methods and applications: new developments in knowledge discovery in information systems
Rough set methods and applications: new developments in knowledge discovery in information systems
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems
Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems
Rough Sets: Mathematical Foundations
Rough Sets: Mathematical Foundations
On Rough Set Logics Based on Similarity Relations
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Rough-fuzzy-neurocomputing based on rough mereological calculus of granules
International Journal of Hybrid Intelligent Systems - Hybrid Intelligence using rough sets
A rough set paradigm for unifying rough set theory and fuzzy set theory
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Propositional logics from rough set theory
Transactions on rough sets VI
Mereological theories of concepts in granular computing
Transactions on computational science II
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Hi-index | 0.00 |
This article comes up a couple of months after the death of Professor Zdzisław Pawlak who created in 1982 the theory of rough sets as a vehicle to carry out Concept Approximation and a fortiori, Decision Making, Data Mining, Knowledge Discovery and other activities At the roots of rough set theory, was a deep knowledge of ideas going back to Frege, Russell, Łukasiewicz, Popper, and others Rough sets owe this attitude the intrinsic clarity of ideas, elegant simplicity (not to be confused with easy triviality), and a fortiori a wide spectrum of applications Over the years, rough set theory has been enriched with new ideas One of those additions has been rough mereology, an attempt at introducing a regular form of tolerance relations on objects in an information system, in order to provide a more flexible scheme of relating objects than indiscernibility. The theory of mereology, proposed long ago (1916) by S. Lesniewski, proved a valuable source of inspiration. As a result, a more general theory has emerged, still far from completion Rough mereology, operating with so called rough inclusions, allows for definitions of a class of logics, that in turn have applications to distributed systems, perception analysis, granular computing etc. etc. In this article, we give a survey of the present state of art in the area of rough mereological theory of reasoning, as we know it, along with comments on some problems