Abstract
In this paper, we propose two-sorted modal logics for the representation and reasoning of concepts arising from rough set theory (RST) and formal concept analysis (FCA). These logics are interpreted in two-sorted bidirectional frames, which are essentially formal contexts with converse relations. The logic \({\textbf {KB}}\) contains ordinary necessity and possibility modalities and can represent rough set-based concepts. On the other hand, the logic \({\textbf {KF}}\) has window modality that can represent formal concepts. We study the relationship between KB and KF by proving a correspondence theorem. It is then shown that, using the formulae with modal operators in KB and KF, we can capture formal concepts based on RST and FCA and their lattice structures.
This work is partially supported by National Science and Technology Council (NSTC) of Taiwan under Grant No. 110-2221-E-001-022-MY3.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Balbiani, P.: Deciding the word problem in pure double Boolean algebras. J. Appl. Log. 10(3), 260–273 (2012)
Blackburn, P., De Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)
Conradie, W., et al.: Rough concepts. Inf. Sci. 561, 371–413 (2021)
Düntsch, I., Gediga, G.: Modal-style operators in qualitative data analysis. In: Vipin, K., et al. (eds.) Proceedings of the 2002 IEEE International Conference on Data Mining, pp. 155–162. IEEE Computer Society (2002)
Ganter, B., Meschke, C.: A formal concept analysis approach to rough data tables. In: Peters, J.F., et al. (eds.) Transactions on Rough Sets XIV. LNCS, vol. 6600, pp. 37–61. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-21563-6_3
Gargov, G., Passy, S., Tinchev, T.: Modal environment for Boolean speculations. In: Skordev, D.G. (eds) Mathematical Logic and Its Applications, pp. 253–263, Springer, Boston (1987). https://doi.org/10.1007/978-1-4613-0897-3_17
Howlader, P., Banerjee, M.: Kripke contexts, double Boolean algebras with operators and corresponding modal systems. J. Logic Lang. Inform. 32, 117–146 (2023)
Howlader, P., Banerjee, M.: A non-distributive logic for semiconcepts and its modal extension with semantics based on Kripke contexts. Int. J. Approximate Reasoning 153, 115–143 (2023)
Howlader, P., Banerjee, M.: Topological representation of double Boolean algebras. Algebra Univer. 84, Paper No. 15, 32 (2023)
Hu, K., Sui, Y., Lu, Y., Wang, J., Shi, C.: Concept approximation in concept lattice. In: Cheung, D., Williams, G.J., Li, Q. (eds.) PAKDD 2001. LNCS (LNAI), vol. 2035, pp. 167–173. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45357-1_21
Kent, R.E.: Rough concept analysis. In: Ziarko, W.P. (ed.) Rough Sets. Fuzzy Sets and Knowledge Discovery, pp. 248–255. Springer, London (1994). https://doi.org/10.1007/978-1-4471-3238-7_30
Leuştean, L., Moangă, N., Şerbănuţă, T.F.: A many-sorted polyadic modal logic. Fund. Inform. 173(2–3), 191–215 (2020)
Meschke, C.: Approximations in concept lattices. In: Kwuida, L., Sertkaya, B. (eds.) ICFCA 2010. LNCS (LNAI), vol. 5986, pp. 104–123. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-11928-6_8
Pawlak, Z.: Rough sets. Int. J. Comput. Inform. Sci. 11(5), 341–356 (1982)
Saquer, J., Deogun, J.S.: Concept approximations based on rough sets and similarity measures. Int. J. Appl. Math. Comput. Sci. 11(3), 655–674 (2001)
Vormbrock, B., Wille, R.: Semiconcept and protoconcept algebras: the basic theorems. In: Ganter, B., Stumme, G., Wille, R. (eds.) Formal Concept Analysis. LNCS (LNAI), vol. 3626, pp. 34–48. Springer, Heidelberg (2005). https://doi.org/10.1007/11528784_2
Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Ferré, S., Rudolph, S. (eds.) ICFCA 2009. LNCS (LNAI), vol. 5548, pp. 314–339. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-01815-2_23
Wille, R.: Boolean concept logic. In: Ganter, B., Mineau, G.W. (eds.) ICCS-ConceptStruct 2000. LNCS (LNAI), vol. 1867, pp. 317–331. Springer, Heidelberg (2000). https://doi.org/10.1007/10722280_22
Yao, Y.: A comparative study of formal concept analysis and rough set theory in data analysis. In: Tsumoto, S., Słowiński, R., Komorowski, J., Grzymała-Busse, J.W. (eds.) RSCTC 2004. LNCS (LNAI), vol. 3066, pp. 59–68. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-25929-9_6
Yao, Y.Y.: Concept lattices in rough set theory. In: IEEE Annual Meeting of the Fuzzy Information Processing Society-NAFIPS, vol. 2, pp. 796–801. IEEE (2004)
Yao, Y.Y., Chen, Y.: Rough set approximations in formal concept analysis. In: Peters, J.F., et al. (eds.) Transactions on Rough Sets V, pp. 285–305. Springer, Berlin (2006)
Yao, Y.Y., Lin, T.Y.: Generalization of rough sets using modal logics. Intell. Autom. Soft Comput. 2(2), 103–119 (1996)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Howlader, P., Liau, CJ. (2023). Two-Sorted Modal Logic for Formal and Rough Concepts. In: Campagner, A., Urs Lenz, O., Xia, S., Ślęzak, D., Wąs, J., Yao, J. (eds) Rough Sets. IJCRS 2023. Lecture Notes in Computer Science(), vol 14481. Springer, Cham. https://doi.org/10.1007/978-3-031-50959-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-031-50959-9_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-50958-2
Online ISBN: 978-3-031-50959-9
eBook Packages: Computer ScienceComputer Science (R0)