Skip to main content

Interface of Rough Set Systems and Modal Logics: A Survey

  • Chapter
  • First Online:
Transactions on Rough Sets XIX

Part of the book series: Lecture Notes in Computer Science ((TRS,volume 8988))

Abstract

In this paper the relationship between rough set theory and modal logic has been discussed. Pawlakian rough set theory has obvious connection with modal logic system \(S_5\). With the introduction of various other lower and upper approximation operators, other modal systems come into picture. Besides, the possibility of new modal systems also crop up. Some of these issues are focused here.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Banerjee, M.: Logic for rough truth. Fundamenta Informaticae 71(2,3), 139–151 (2006)

    MathSciNet  MATH  Google Scholar 

  2. Banerjee, M., Chakraborty, M.K.: Rough algebra. Bull. Polish Acad. Sc. (Math.) 41(4), 293–297 (1993)

    MathSciNet  MATH  Google Scholar 

  3. Banerjee, M., Chakraborty, M.K.: Rough sets through algebraic logic. Fundamenta Informatica 28(3–4), 211–221 (1996)

    MathSciNet  MATH  Google Scholar 

  4. Banerjee, M., Chakraborty, M.K.: Rough logics : a survey with further directions. In: Orloska, E. (ed.) Incomplete Information: Rough Set Analysis Studies in Fuzziness and Soft Computing, vol. 13, pp. 578–600. Physica-Verlag, Heidelberg (1998)

    Google Scholar 

  5. Banerjee, M., Chakraborty, M.K.: Algebras from rough sets. In: Pal, S., Polkowski, L., Skowron, A. (eds.) Rough-Neural Computing. Cognitive Technologies, pp. 157–184. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Banerjee, M., Yao, Y.: A categorial basis for granular computing. In: An, A., Stefanowski, J., Ramanna, S., Butz, C.J., Pedrycz, W., Wang, G. (eds.) RSFDGrC 2007. LNCS (LNAI), vol. 4482, pp. 427–434. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Bonikowski, Z.: A certain conception of the calculus of rough sets. Notre Dame J. Formal logic 33, 412–421 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  8. Bonikowski, Z., Bryniarski, E., Urszula, W.S.: Extensions and intentions in the rough set theory. J. Inf. Sci. 107, 149–167 (1998)

    Article  MATH  Google Scholar 

  9. Bunder, M.W.: Rough consequence and Jaskowskis D2 logics. Technical report 2/04, School of Mathematics and Applied Statistics, University of Wollongong, Australia (2004)

    Google Scholar 

  10. Bunder, M.W., Banerjee, M., Chakraborty, M.K.: Some rough consequence logics and their interrelations. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets VIII. LNCS, vol. 5084, pp. 1–20. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. Chakraborty, M.K., Banerjee, M.: Rough consequence. Bull. Polish Acad. Sc(Math.) 41(4), 299–304 (1993)

    MathSciNet  MATH  Google Scholar 

  12. Hughes, G.E., Cresswell, M.J.: A New Introduction to Modal Logic. Routledge, London (1996)

    Book  MATH  Google Scholar 

  13. Kumar, A., Banerjee, M.: Definable and rough sets in covering-based approximation spaces. In: Li, T., Nguyen, H.S., Wang, G., Grzymala-Busse, J., Janicki, R., Hassanien, A.E., Yu, H. (eds.) RSKT 2012. LNCS, vol. 7414, pp. 488–495. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  14. Li, T.-J.: Rough approximation operators in covering approximation spaces. In: Greco, S., Hata, Y., Hirano, S., Inuiguchi, M., Miyamoto, S., Nguyen, H.S., Słowiński, R. (eds.) RSCTC 2006. LNCS (LNAI), vol. 4259, pp. 174–182. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  15. Liu, J., Liao, Z.: The sixth type of covering-based rough sets. In: Granular Computing - GrC, Hangzhou 26–28 August 2008. Published in IEEE International Conference on Granular Computing 2008, pp. 438–441 (2008)

    Google Scholar 

  16. Orlowska, E.: A Logic of indiscernibility relations. In: Skowron, A. (ed.) Computation Theory. LNCS, vol. 208, pp. 177–186. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  17. Orlowska, E.: Logic for nondeterministic information. Stud. Logica XLIV, 93–102 (1985)

    MathSciNet  Google Scholar 

  18. Orlowska, E.: Logic for reasoning about knowledge. Zeitschr. f. math. Logik und Grundlagen d.Math. 35, 559–572 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  19. Pawlak, Z.: Rough Sets - Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishers, Dordrecht (1991)

    MATH  Google Scholar 

  20. Pagliani, P., Chakraborty, M.K.: A geometry of Approximation - Rough Set theory: Logic Algebra and Topology of Conceptual Patterns. Springer, Netherlands (2008)

    Book  Google Scholar 

  21. Pomykala, J.A.: Approximation operations in approximation space. Bull. Pol. Acad. Sci. Math. 35, 653–662 (1987)

    MathSciNet  MATH  Google Scholar 

  22. Pomykala, J.A.: Approximation, Similarity and Rough Constructions. ILLC Prepublication Series for Computation and Complexity Theory CT-93-07, University of Amsterdam (1993)

    Google Scholar 

  23. Qin, K., Gao, Y., Pei, Z.: On covering rough sets. In: Yao, J.T., Lingras, P., Wu, W.-Z., Szczuka, M.S., Cercone, N.J., Ślȩzak, D. (eds.) RSKT 2007. LNCS (LNAI), vol. 4481, pp. 34–41. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  24. Samanta, P., Chakraborty, M.K.: Covering based approaches to rough sets and implication lattices. In: Sakai, H., Chakraborty, M.K., Hassanien, A.E., Slezak, D., Zhu, W. (eds.) RSFDGrC 2009. LNCS, vol. 5908, pp. 127–134. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  25. Samanta, P., Chakraborty, M.K.: Generalized rough sets and implication lattices. In: Peters, J.F., Skowron, A., Sakai, H., Chakraborty, M.K., Slezak, D., Hassanien, A.E., Zhu, W. (eds.) Transactions on Rough Sets XIV. LNCS, vol. 6600, pp. 183–201. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  26. Ślȩzak, D., Wasilewski, P.: Granular sets – foundations and case study of tolerance spaces. In: An, A., Stefanowski, J., Ramanna, S., Butz, C.J., Pedrycz, W., Wang, G. (eds.) RSFDGrC 2007. LNCS (LNAI), vol. 4482, pp. 435–442. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  27. Vakarelov, D.: A modal logic for similarity relations in Pawlak knowledge representation systems. Fundamenta Informaticae XV, 61–79 (1991)

    MathSciNet  Google Scholar 

  28. Vakarelov, D.: Similarity relations and modal logics. In: Orlowska, E. (ed.) Incomplete Information : Rough Set Analysis Studies in Fuzziness and Soft Computing, vol. 13, pp. 492–550. Physica-Verlag, Heidelberg (1998)

    Chapter  Google Scholar 

  29. Yao, Y.Y., Lin, T.Y.: Generalization of rough sets using model logic. Intell. Automaton Soft Comput. 2(2), 103–120 (1996)

    Article  MathSciNet  Google Scholar 

  30. Yao, Y.Y.: Constructive and algebraic methods of the theory of rough sets. J. Inf. Sci. 109, 21–47 (1998)

    Article  MATH  Google Scholar 

  31. Yao, Y.Y.: On generalizing rough set theory. In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds.) Rough set, Fuzzy sets, Data Mining and Granular Computing. Lecture Notes in Computer Science, vol. 2639, pp. 44–51. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  32. Yao, Y., Yao, B.: Covering based rough set approximations. Inf. Sci. 200, 91–107 (2012)

    Article  MATH  Google Scholar 

  33. Zhu, W.: Topological approaches to covering rough sets. Sci. Direct Inf. Sci. 177, 1499–1508 (2007)

    MATH  Google Scholar 

  34. Zhu, W.: Relationship between generalized rough sets based on binary relation and covering. Inf. Sci. 179, 210–225 (2009)

    Article  MATH  Google Scholar 

  35. Zhu, W.: Properties of the second type of covering-based rough sets. In: Butz, C.J., Nguyen, N.T., Takama, Y., Cheung, W., Cheung, Y.M. (eds.) IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Hong Kong, China 18–22 December 2006 Proceedings of the - WI-IAT 2006 Workshops, pp. 494–497. IEEE (2006)

    Google Scholar 

  36. Zhu, W., Wang, F.Y.: Relationship among three types of covering rough sets. In: Proceedings of the IEEE International Conference on Grannular Computing-GrC, pp. 43–48 (2006)

    Google Scholar 

  37. Zhu, W., Wang, F.Y.: Properties of the first type of covering-based rough sets. In: Tsumoto, S., Clifton, C.W., Zhong, N., Xindong Wu, Liu, J., Wah, B.W., Cheung, Y.M. (eds.) Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops, ICDMW Hong Kong, China December 2006, pp. 407–411. IEEE Computer Society (2006)

    Google Scholar 

  38. Zhu, W., Wang, F.-Y.: Binary relation based rough sets. In: Wang, L., Jiao, L., Shi, G., Li, X., Liu, J. (eds.) FSKD 2006. LNCS (LNAI), vol. 4223, pp. 276–285. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

Download references

Acknowledgement

We would like to thank Prof. Mohua Banerjee, IIT Kanpur for her valuable comments and suggestions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pulak Samanta .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Samanta, P., Chakraborty, M.K. (2015). Interface of Rough Set Systems and Modal Logics: A Survey. In: Peters, J., Skowron, A., Ślȩzak, D., Nguyen, H., Bazan, J. (eds) Transactions on Rough Sets XIX. Lecture Notes in Computer Science(), vol 8988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47815-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-47815-8_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-47814-1

  • Online ISBN: 978-3-662-47815-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics