Skip to main content

Rough Mereological Reasoning in Rough Set Theory: Recent Results and Problems

  • Conference paper
Rough Sets and Knowledge Technology (RSKT 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4062))

Included in the following conference series:

  • 1122 Accesses

  • 5 Citations

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Frege’s Logic, Theorem, and Foundations for Arithmetic. In: Stanford Encyclopedia of Philosophy at http://plato.stanford.edu

  2. Hajek, P.: Metamathematics of Fuzzy Logic. Kluwer, Dordrecht (1998)

    MATH  Google Scholar 

  3. Lesniewski, S.: Podstawy ogolnej teoryi mnogosci (On the foundations of set theory, in Polish), Moscow. The Polish Scientific Circle (1916), See also: Foundations of the General Theory of Sets. I. In: Surma, S.J., Srzednicki, J., Barnett, D.I., Rickey, V.F. (eds.) Lesniewski, S. Collected Works, vol. 1, pp. 129-173. Kluwer, Dordrecht (1992)

    Google Scholar 

  4. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer, Dordrecht (1991)

    MATH  Google Scholar 

  5. Pawlak, Z.: Rough sets. Int. J. Comp. Inform. Science. 11, 341–356 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  6. Pawlak, Z., Skowron, A.: Rough membership functions. In: Yager, R.R., Fedrizzi, M., Kasprzyk, J. (eds.) Advances in the Dempster–Shafer Theory of Evidence, pp. 251–271. Wiley, New York (1994)

    Google Scholar 

  7. Polkowski, L.: Rough Sets. Mathematical Foundations. Physica–Verlag, Heidelberg (2002)

    MATH  Google Scholar 

  8. Polkowski, L.: A rough set paradigm for unifying rough set theory and fuzzy set theory (a plenary lecture). In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds.) RSFDGrC 2003. LNCS (LNAI), vol. 2639, pp. 70–78. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. Polkowski, L.: Toward rough set foundations. Mereological approach (a plenary lecture). In: Tsumoto, S., Słowiński, R., Komorowski, J., Grzymała-Busse, J.W. (eds.) RSCTC 2004. LNCS (LNAI), vol. 3066, pp. 8–25. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Polkowski, L., Semeniuk–Polkowska, M.: On rough set logics based on similarity relations. Fundamenta Informaticae 64, 379–390 (2005)

    MATH  MathSciNet  Google Scholar 

  11. Polkowski, L.: Rough–fuzzy–neurocomputing based on rough mereological calculus of granules. International Journal of Hybrid Intelligent Systems 2, 91–108 (2005)

    MATH  Google Scholar 

  12. Polkowski, L.: Formal granular calculi based on rough inclusions (a feature talk). In: Proceedings of the 2005 IEEE International Conference on Granular Computing, Beijing, China, pp. 57–62. IEEE Press, Los Alamitos (2005)

    Chapter  Google Scholar 

  13. Polkowski, L., Semeniuk–Polkowska, M.: A formal approach to Perception Calculus of Zadeh by means of rough mereological logic. In: Proceedings of the 11th International Conference on Information Processing and Management of Uncertainty in Knowledge –Based Systems (IPMU 2006), Paris (in print, 2006)

    Google Scholar 

  14. Polkowski, L., Semeniuk–Polkowska, M.: Mereology in approximate reasoning about concepts. In: Valore, P. (ed.) Formal Ontology and Mereology, Polimetrica International Publishers, Monza, Italy (2006)

    Google Scholar 

  15. Polkowski, L., Skowron, A.: Rough mereology: A new paradigm for approximate reasoning. International Journal of Approximate Reasoning 15, 333–365 (1997)

    Article  MathSciNet  Google Scholar 

  16. Polkowski, L., Skowron, A.: Rough Sets in Knowledge Discovery. Applications, Case Studies and Software Systems. Physica–Verlag, Heidelberg (1998)

    Google Scholar 

  17. Polkowski, L., Tsumoto, S., Lin, T.Y.: Rough Set Methods and Applications. Physica–Verlag, Heidelberg (2000)

    Google Scholar 

  18. Scotus, J.D.: A Treatise on God as First Principle at www.ewtn.com/library/theology/godasfir.htm

  19. Skowron, A., et al.: RSES 2.2 at http://logic.mimuw.edu.pl/~rses/

  20. Ziarko, W.: Variable precision rough set model. Journal of Computer and Systems Science 46, 39–59 (1993)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Polkowski, L. (2006). Rough Mereological Reasoning in Rough Set Theory: Recent Results and Problems. In: Wang, GY., Peters, J.F., Skowron, A., Yao, Y. (eds) Rough Sets and Knowledge Technology. RSKT 2006. Lecture Notes in Computer Science(), vol 4062. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11795131_13

Download citation

Keywords

Publish with us

Policies and ethics