Abstract
Representations of the lower and upper approximations of a set in the context of an approximation space as modal operators in the first order language of modal logics, are quite natural and widely familiar now to the rough-set community. According to the perception of an observer, objects of a universe (of discourse) are clustered. These are the basic information granules (or quanta). With respect to the information available, objects belonging to the same cluster are indistinguishable. It may not always be the case that the clusters are mutually disjoint.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Banerjee, M.: Logic for rough truth. Fund. Informaticae 71(2-3), 139–151 (2006)
Banerjee, M., Chakraborty, M.K.: Rough consequence and rough algebra. In: Ziarko, W.P. (ed.) Rough Sets, Fuzzy Sets and Knowledge Discovery, Proc. RSKD 1993, pp. 196–207. Springer, London (1994)
Bunder, M.W.: Rough consequence and Jaśkowski’s D2 logics. Technical Report 2/04. School of Mathematics and Applied Statistics, University of Wollongong, Australia (2004)
Bunder, M.W., Banerjee, M., Chakraborty, M.K.: Some rough consequence logics and their interrelations. Transactions on Rough Sets (to appear)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chakraborty, M.K. (2008). Rough Logics with Possible Applications to Approximate Reasoning. In: Wang, G., Li, T., Grzymala-Busse, J.W., Miao, D., Skowron, A., Yao, Y. (eds) Rough Sets and Knowledge Technology. RSKT 2008. Lecture Notes in Computer Science(), vol 5009. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79721-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-79721-0_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79720-3
Online ISBN: 978-3-540-79721-0
eBook Packages: Computer ScienceComputer Science (R0)