Abstract
Many researchers study rough sets from the point of view of description of the rough set pairs(a rough set pair is also called a rough set), i.e. <lower approximation set, upper approximation set>. An important result is that the collection of rough sets of an approximation space can be made into a regular double Stone algebra. In this paper, a logic for rough sets, i.e., the sequent calculus corresponding to rough double Stone algebra, is proposed. The syntax and semantics are defined. The soundless and completeness are proved.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Banerjee, M., Chakraborty, M.K.: Rough sets through algebraic logic. Fundamenta Informaticae 28, 211–221 (1996)
Comer, S.: On connections between information systems, rough sets and algebraic logic. In: Algebraic methods in logic and computer science, pp. 117–124. Banach Center Publications (1993)
Dai, J.H.: Structure of rough approximations based on molecular lattices. In: Tsumoto, S., Słowiński, R., Komorowski, J., Grzymała-Busse, J.W. (eds.) RSCTC 2004. LNCS (LNAI), vol. 3066, pp. 69–77. Springer, Heidelberg (2004)
Düntsch, I.: A logic for rough sets. Theoretical Computer Science, 427–436 (1997)
Gehrke, M., Walker, E.: On the structure of rough sets. Bulletin of the Polish Academy of Sciences: Mathematics 40, 235–255 (1992)
Iturrioz, L.: Rough sets and 3-valued structures. In: Orlowska, E. (ed.) Logic at work, pp. 596–603. Springer, Heidelberg (1998)
Iwiński, T.B.: Algebraic approach to rough sets. Bulletin of the Polish Academy of Sci-ences: Mathematics 35, 673–683 (1987)
Jarvinen, J.: On the structure of rough approximations. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds.) RSCTC 2002. LNCS (LNAI), vol. 2475, pp. 123–130. Springer, Heidelberg (2002)
Lin, T.Y., Liu, Q.: Rough approximate operators: Axiomatic rough set theory. In: Ziarko, W.P. (ed.) Rough Sets, Fuzzy Sets and Knowledge Discovery, pp. 256–260. Springer, Berlin (1994)
Pagliani, P.: Rough sets and Nelson algebras. Fundamenta Informaticae 27, 205–219 (1996)
Pagliani, P.: Rough set theory and logic-algebraic structures. In: Orlowska, E. (ed.) Incomplete information: Rough set analysis, pp. 109–190. Physica, Heidelberg (1998)
Pawlak, Z.: Rough Sets-Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)
Pomykala, J., Pomykala, J.A.: The Stone algebra of rough sets. Bulletin of the Polish Academy of Sciences: Mathematics 36, 495–508 (1988)
Rasiowa, H.: An algebraic approach to non-classical logics. North Holland, Amsterdam (1974)
Sen, J., Chakraborty, M.K.: A study of interconnections between rough and 3-valued Lukasiewicz logics. Fundamenta Informaticae 51, 311–324 (2002)
Yao, Y.Y.: Constructive and algebraic methods of the theory of rough sets. Information Sciences 109, 21–47 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dai, JH. (2005). Logic for Rough Sets with Rough Double Stone Algebraic Semantics. In: Ślęzak, D., Wang, G., Szczuka, M., Düntsch, I., Yao, Y. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2005. Lecture Notes in Computer Science(), vol 3641. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11548669_15
Download citation
DOI: https://doi.org/10.1007/11548669_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28653-0
Online ISBN: 978-3-540-31825-5
eBook Packages: Computer ScienceComputer Science (R0)