Monadic Algebras: a Standpoint on Rough Sets

• Autorzy: Wolski M.
• Języki publikacji: EN

Abstrakty

EN

The paper studies complete and incomplete information systems, i.e. basic structures of rough set theory (RST), from the standpoint of monadic Boolean algebras (MBAs). In the first part we recall a simple characterisation of RST as a theory of MBAs. In the second part the paper discusses approximation operators obtained from incomplete information systems. In this case we lose a direct link to MBAs and thus our aim is to obtain an MBA which will additionally be interesting from the perspective of RST. In the third part we consider a simple application of approximation operators based on this MBA.

Słowa kluczowe

EN

rough set theory; incomplete information systems

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2011
• Tom: Vol. 108, nr 3/4
• Strony: 181--196
• Opis fizyczny: Bibliogr. 26 poz.

Twórcy

autor

Wolski M.

• Department of Logic and Methodology of Science, Maria Curie-Skłodowska University, Poland,

Bibliografia

• [1] Arkhangel'skii, A. V., Fedorchuk, V. V. (1990) The Basic Concepts and Constructions of General Topology. In Arkhangel'skii, A. V. Pontryagin L. S. (Eds.), General Topology I, Encyclopedia of Mathematical Sciences, Vol. 17, Springer-Verlag.
• [2] Atran, S. (1995): Classifying Nature Across Cultures, in: An Invitation to Cognitive Science. Thinking (Osherson, D., Smith, E., eds.), MIT Press, Cambridge,Massachusetts, 131-174.
• [3] Bennett, B. (1996): Modal logics for qualitative spatial reasoning, J. IGPL, 4 (1), 23-45.
• [4] Bezhanishvili, G., Gehrke, M. (2005): Completeness of S4 with respect to the real line: revisited, Ann. Pure Appl. Logic, 131, No.1-3, 287-301.
• [5] Birkhoff, G. (1937): Rings of sets, Duke Mathematical Journal 3, 443-454.
• [6] Düntch, I., Gediga, G. (2002): Modal-style operators in qualitative data analysis, Proc. of the 2002 IEEE Conference on Data Mining (ICDM'2002), 155-162.
• [7] Düntsh, I., Gediga, G. (2003): Approximation operators in qualitative data analysis. In de Swart, H. et al. (Eds.), Theory and Applications of Relational Structures as Knowledge Instruments, LNCS, 216-233, Springer, Heidelberg.
• [8] Erne,M., Klossowski, E., Melton, A., Strecker, G. E. (1993): A primer on Galois connections. In Proceedings of the 1991 Summer Conference on General Topology and Applications in Honor of Mary Elen Rudin and Her Work, Vol. 704 of Annals of the New York Academy of Sciences, 103-125.
• [9] Iturrioz, L. (2007): Two representation theorems of three-valued structures by means of binary relations, CoRR abs/0710.100, http://arxiv.org/abs/0710.1007.
• [10] Grzymała-Busse, J. W. (2006): A Rough Set Approach to Data with Missing Attribute Values. In Wang, G., Peters, J. F., Skowron, A., Yao, Y. (Eds.) Rough Sets and Knowledge Technology, First International Conference, RSKT 2006, Lecture Notes in Computer Science 4062, Springer, 58-67.
• [11] Halmos P. (1955): Algebraic logic I. Monadic Boolean algebras, Compositio Mathematica,12, 217-249.
• [12] Halmos P. (1959): The representation of monadic Boolean algebras, Duke Mathematical Journal, 26, 447- 454.
• [13] Monteiro A. (1959), Algebras Monádicas, Atas do Segundo Colóquio Brasileiro de Matemática, Brasil, 33-52.
• [14] Osherson, D.N., Smith, E.E., Wilkie, O., Lopez, A. & Shafir, E. (1990): Category-Based Induction, Psychological Review, 97(2), 185-200.
• [15] Pagliani, P., Chakraborty, M. (2005): Information quanta and approximation spaces. I: Non-classical approximation operators. In Hu, X., Liu, Q., Skowron, A., Lin, T. S., Yager, R. R., Zhang, E. B. (Eds.), Proceedings of the IEEE International Conference on Granular Computing, Vol. 2, IEEE, 605-610.
• [16] Pagliani, P., Chakraborty,M. (2005): Information quanta and approximation spaces. II: Generalised approximation space. In Hu, X., Liu, Q., Skowron, A., Lin, T. S., Yager, R. R., Zhang, E. B. (Eds.), Proceedings of the IEEE International Conference on Granular Computing, Vol. 2, IEEE, 611-616.
• [17] Pawlak, Z. (1982): Rough sets, Int. J. Computer and Information Sci., 11, 341-356.
• [18] Pawlak, Z. (1987): Rough logic, Bull. Polish Acad. Sc. (Tech. Sc.), 35(5-6), 253-258.
• [19] Pawlak, Z. (1991): Rough Sets: Theoretical Aspects of Reasoning aboutData, Kluwer Academic Publisher.
• [20] Quine,W. (1976): The Ways of Paradox and Other Essays, Harvard University Press.
• [21] Rasiowa, H. (2001): Algebraic Models of Logics, University of Warsaw.
• [22] Wille, R. (1982): Reconstructing lattice theory: An approach based on hierarchies of concepts. In Rival, I. (Ed.), Ordered Sets, NATO Advanced Studies Institute, Dordrecht, Reidel, 445-470.
• [23] Wiweger, A. (1989): On topological rough sets, Bulletin of the Polish Academy of Sciences, Mathematics, 37, 89-93, 1989.
• [24] Wolski, M. (2008): Information Quanta and Approximation Operators: Once More Around the Track, Transactions on Rough Sets, 8, Lecture Notes in Computer Science 5084, Springer, 237-250.
• [25] Wolski, M. (2008): Category-Based Inductive Reasoning: Rough Set Theoretic Approach, Transactions on Rough Sets, 9, Lecture Notes in Computer Science 5390, Springer, 428-443.
• [26] Yao, Y.Y., Lin, T.Y. (1996): Generalization of rough sets using modal logic, Intelligent Automation and Soft Computing, An International Journal Vol. 2, No. 2, 103-120.