Skip to main content
SpringerLink
Log in

Rough and Near: Modal History of Two Theories

  • Conference paper
  • First Online:
Rough Sets (IJCRS 2017)

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

Included in the following conference series:

  • 1098 Accesses

Abstract

Near sets were introduced by J.F. Peters in 2007 in the context and within the conceptual framework of rough sets, which were initiated by Z. Pawlak in the early 1980s. However, due to further evolution and development, near set theory has become an independent field of study. For this reason, nowadays, the relationships between near set theory and rough set theory are not easy to spot. In this short paper we would like to re-define near sets and to re-think their foundations and relationships to/bearing on rough sets. To this end we translate the basic concepts of near set theory into the framework of modal logic, which has already been successfully applied to rough sets. The concept of nearness of sets, however, was originally defined globally (that is, with respect to the whole underlying space), but modal logic is intrinsically local: the logical value of a formula is computed with respect to a single point and its neighbourhood. Our approach to near sets is local in the very same sense: we are concerned with nearness of sets seen from the perspective of a single point. Interestingly, this local perspective brings together rough set theory and near set theory, revealing their deep theoretical connections. Therefore, what we offer is a modal and algebraic “shared history” of the two theories at issue.

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Aczel, P.: Non-Well-Founded Sets. CSLI Lecture Notes, vol. 14. CSLI Publications, Stanford (1988)

    MATH  Google Scholar 

  2. Aczel, P., Mendler, N.: A final coalgebra theorem. In: Pitt, D.H., Rydeheard, D.E., Dybjer, P., Pitts, A.M., Poigné, A. (eds.) Category Theory and Computer Science. LNCS, vol. 389, pp. 357–365. Springer, Heidelberg (1989). doi:10.1007/BFb0018361

    Chapter  Google Scholar 

  3. Adámek, J., Herrlich, H., Strecker, G.: Abstract and Concrete Categories. Wiley-Interscience Publication, London (1990)

    MATH  Google Scholar 

  4. Banerjee, M., Khan, M.A.: Propositional logics from rough set theory. In: Peters, J.F., Skowron, A., Düntsch, I., Grzymała-Busse, J., Orłowska, E., Polkowski, L. (eds.) Transactions on Rough Sets VI. LNCS, vol. 4374, pp. 1–25. Springer, Heidelberg (2007). doi:10.1007/978-3-540-71200-8_1

    Chapter  Google Scholar 

  5. Bilkova, M., Palmigiano, A., Venema, Y.: Proof systems for the coalgebraic cover modality. Adv. Modal Log. 7, 1–23 (2008)

    MathSciNet  MATH  Google Scholar 

  6. Bilkova, M., Palmigiano, A., Venema, Y.: Proof systems for Moss’ coalgebraic logic. Theor. Comput. Sci. 549, 36–60 (2014)

    Article  MathSciNet  Google Scholar 

  7. Čech, E.: Topological Spaces. Wiley, London (1966)

    MATH  Google Scholar 

  8. Efremovič, V.: The geometry of proximity I. Mat. Sb. 31, 189–200 (1951). (in Russian) MR 14, 1106

    MathSciNet  Google Scholar 

  9. Herrlich, H.: A concept of nearness. Gen. Topol. Appl. 4, 191–212 (1974)

    Article  MathSciNet  Google Scholar 

  10. Jacobs, B.: Introduction to Coalgebra. Towards Mathematics of States and Observation. Cambridge University Press, Cambridge (2016)

    MATH  Google Scholar 

  11. Janin, D., Walukiewicz, I.: Automata for the modal \(\mu \)-calculus and related results. In: Wiedermann, J., Hájek, P. (eds.) MFCS 1995. LNCS, vol. 969, pp. 552–562. Springer, Heidelberg (1995). doi:10.1007/3-540-60246-1_160

    Chapter  Google Scholar 

  12. Kupke, K., Kurz, A., Venema, Y.: Completeness for the coalgebraic cover modality. Log. Methods Comput. Sci. 8, 1–76 (2012)

    Article  MathSciNet  Google Scholar 

  13. Moss, L.: Coalgebraic logic. Ann. Pure Appl. Log. 96, 277–317 (1999)

    Article  Google Scholar 

  14. Naimpally, S.: Proximity Approach to General Topology. Lakehead University, Thunder Bay (1974)

    Google Scholar 

  15. Naimpally, S., Peters, J.: Topology with Applications. Topological Spaces via Near and Far. World Scientific, Singapore (2013)

    Book  Google Scholar 

  16. Pawlak, Z.: Classification of Objects by Means of Attributes. Institute of Computer Science, Polish Academy of Sciences PAS 429, Warsaw (1981)

    Google Scholar 

  17. Pawlak, Z.: Rough sets. Int. J. Comput. Inf. Sci. 11, 341–356 (1982)

    Article  Google Scholar 

  18. Pawlak, Z.: Rough sets and decision tables. In: Skowron, A. (ed.) SCT 1984. LNCS, vol. 208, pp. 187–196. Springer, Heidelberg (1985). doi:10.1007/3-540-16066-3_18

    Chapter  Google Scholar 

  19. Pawlak, Z.: Rough logic. Bull. Pol. Acad. Sci. (Tech. Sci.) 35(5–6), 253–258 (1987)

    MathSciNet  MATH  Google Scholar 

  20. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publisher, Berlin (1991)

    Book  Google Scholar 

  21. Pawlak, Z.: Wiedza z Perspektywy Zbiorów Przybliżonych. Institute of Computer Science Report 23, Toronto (1992)

    Google Scholar 

  22. Peters, J.: Near sets. special theory about nearness of objects. Fundam. Inform. 75(1–4), 407–433 (2007)

    MathSciNet  MATH  Google Scholar 

  23. Peters, J.: Near sets. General theory about nearness of objects. Appl. Math. Sci 1(53), 2609–2629 (2007)

    MathSciNet  MATH  Google Scholar 

  24. Peters, J., Skowron, A., Stepaniuk, J.: Nearness in approximation spaces. In: Proceedings of Concurrency, Specification and Programming (CS&P 2006), Humboldt Universitat, pp. 435–445 (2006)

    Google Scholar 

  25. Peters, J., Naimpally, S.: Applications of near sets. Am. Math. Soc. Not. 59(4), 536–542 (2012). doi:10.1090/noti817.

    Article  MathSciNet  MATH  Google Scholar 

  26. Priest, G.: An Introduction to Non-classical Logic. Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

  27. Riesz, F.: Stetigkeitsbegriff und abstrakte mengenlehre. IV Congresso Internazionale dei Matematici II, pp. 18–24 (1908)

    Google Scholar 

  28. Yao, Y.Y., Lin, T.Y.: Generalization of rough sets using modal logic. Intell. Autom. Soft Comput. 2(2), 103–120 (1996)

    Article  Google Scholar 

Download references

Acknowledgements

We would like to thank anonymous reviewers for careful reading the manuscript, their insightful comments, and corrections.

Author information

Authors and Affiliations

  1. Department of Logic and Cognitive Science, Maria Curie-Skłodowska University, Maria Curie-Skłodowska Sq. 4, 20-031, Lublin, Poland

    Marcin Wolski

  2. Faculty of Mathematics and Informatics, University of Białystok, Konstantego Ciołkowskiego 1M, 15-245, Białystok, Poland

    Anna Gomolińska

Authors
  1. Marcin Wolski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anna Gomolińska
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marcin Wolski .

Editor information

Editors and Affiliations

  1. Polish-Japanese Academy of Information Technology, Warsaw, Poland

    Lech Polkowski

  2. University of Regina, Regina, SK, Canada

    Yiyu Yao

  3. University of Warmia and Mazury, Olsztyn, Poland

    Piotr Artiemjew

  4. University of Milano-Bicocca, Milano, Italy

    Davide Ciucci

  5. Southwest Jiaotong University, Chengdu, China

    Dun Liu

  6. Warsaw University, Warszawa, Poland

    Dominik Ślęzak

  7. Silesian University, Sosnowiec, Poland

    Beata Zielosko

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Wolski, M., Gomolińska, A. (2017). Rough and Near: Modal History of Two Theories. In: Polkowski, L., et al. Rough Sets. IJCRS 2017. Lecture Notes in Computer Science(), vol 10313. Springer, Cham. https://doi.org/10.1007/978-3-319-60837-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-60837-2_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-60836-5

  • Online ISBN: 978-3-319-60837-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation