Abstract
This paper deals with a survey of some aspects of covering based approaches to rough set theory and their implication lattices.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bonikowski, Z.: A Certain Copnception of the Calculus of Rough Sets. Notre Dame J. Formal Logic 33, 412–421 (1992)
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)
Chakraborty, M.K., Banerjee, M.: Rough dialogue and implication lattices. Fundamenta Informaticae 75(1-4), 123–139 (2007)
Chakraborty, M.K., Samanta, P.: Consistency-Degree Between Knowledges. In: Kryszkiewicz, M., Peters, J.F., Rybiński, H., Skowron, A. (eds.) RSEISP 2007. LNCS (LNAI), vol. 4585, pp. 133–141. Springer, Heidelberg (2007)
Liu, J., Liao, Z.: The sixth type of covering-based rough sets. In: GrC 2008 IEEE International Conference on Granular Computing 2008, pp. 438–441 (2008)
Pal, S.K., Polkowski, L., Skowron, A.: Rough - Neural Computing. In: Pal, S.K., Polkowski, L., Skowron, A. (eds.). Springer, Heidelberg (2004)
Pawlak, Z.: ROUGH SETS - Theoritical Aspects of Reasoning About Data. Kluwer Academic Publisher, Dordrecht (1991)
Pomykala, J.A.: Approximation, Similarity and Rough Constructions. ILLC Prepublication Series for Computation and Complexity Theory CT-93-07, University of Amsterdam
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)
Qin, K., Gao, Y., Pei, Z.: On Covering Rough Sets. In: Yao, J., 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)
Skowron, A., Stepaniuk, J.: Tolerance approximation spaces. Fundamenta Informaticae 27, 245–253 (1996)
Samanta, P., Chakraborty, M.K.: On Extension of Dependency and Consistency Degrees of Two Knowledges Represented by Covering. In: Peters, J.F., Skowron, A., Rybiński, H. (eds.) Transactions on Rough Sets IX. LNCS, vol. 5390, pp. 351–364. Springer, Heidelberg (2008)
Slezak, 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)
Yao, Y.Y.: Constructive and algebraic methods of the theory of rough sets. Journal of Information Sciences 109, 21–47 (1998)
Yao, Y.Y.: On generalizing rough set theory. In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds.) RSFDGrC 2003. LNCS (LNAI), vol. 2639, pp. 44–51. Springer, Heidelberg (2003)
Zhu, W.: Topological approaches to covering rough sets. ScienceDirect. Information Sciences 177, 1499–1508 (2007)
Zhu, W., Wang, F.-Y.: Relationship among Three Types of Covering Rough Sets. In: Proc. IEEE Int’l Conf. Grannuler Computing (GrC 2006), May 2006, pp. 43–48 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Samanta, P., Chakraborty, M.K. (2009). Covering Based Approaches to Rough Sets and Implication Lattices. In: Sakai, H., Chakraborty, M.K., Hassanien, A.E., Ślęzak, D., Zhu, W. (eds) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. RSFDGrC 2009. Lecture Notes in Computer Science(), vol 5908. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10646-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-10646-0_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10645-3
Online ISBN: 978-3-642-10646-0
eBook Packages: Computer ScienceComputer Science (R0)