A Modal Logic for Pawlak's Approximation Spaces with Rough Cardinality n

• Autorzy: Balbiani P. , Iliev P. , Vakarelov D.
• Języki publikacji: EN

Abstrakty

EN

The natural modal logic corresponding to Pawlak's approximation spaces is S5, based on the box modality [R]A (and the diamond modality áRn~A=?[R]?A), where R is the corresponding indiscernibility relation of the approximation space S=(W,R). However the expressive power of S5 is too weak and, for instance, we cannot express that the space S has exactly n equivalence classes ( we say that S is roughly-finite and n is the rough cardinality of S). For this reason we extend the modal logic S5 with a new box modality [S]A, where S is the complement of R i.e. the discernibility relation of W. We propose a complete axiomatization, in this new language, of the logic ROUGHn corresponding to the class of approximation spaces with rough cardinality n. We prove that the satisfiability problem for ROUGHn is NP-complete.

Słowa kluczowe

EN

modal logic; logic rough

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2008
• Tom: Vol. 83, nr 4
• Strony: 451--464
• Opis fizyczny: bibliogr. 10 poz.

Twórcy

autor

Balbiani P.

autor

Iliev P.

autor

Vakarelov D.

• Faculty of Mathematics and Computer Science University of Sofia, Blvd. James Bourchier 5, 1126 Sofia, Bulgaria,

Bibliografia

• [1] Blackburn, P., de Rijke, M., Venema, Y. Modal Logic. Cambridge University Press 2001.
• [2] Demri, S. P., and Orlowska, E. Incomplete Information: Structure, Inference, Complexity, Springer-Verlag Berlin Heidelberg 2002.
• [3] Goranko, V. Completeness and incompleteness in the bi-modal base L(R, -R). In P. Petkov, editor, Mathematical Logic, 311-326, Plenum, New York, 1990.
• [4] Goranko, V. Modal definability in enriched languages. Notre Dame Journal of Formal Logic, vol. 31 (1990), 81-105.
• [5] Nguen H. S. Approximate Boolean Reasoning: Foundations and Applications in Data Mining. Transactions on Rough Sets V(LNCS No 4100), 2006, 334-506).
• [6] Orlowska, E. Logic of indiscernibilitry relations. In A. Skowron, editor, 5-th Symposium on Computation Theory, Zaborów, Poland, LNCS, vol. 208,177-186. Springer, Berlin, 1984.
• [7] Pawlak, Z. Rough Sets. International Journal of Information and Computer Sciences, 11, (1982) 341-356.
• [8] Ramanna, S., Peters, J. and Skowron, A. Approaches to Conflict Dynamics Based on Rough Sets. Fundamenta Informaticae, vol 75, (1-4) 2007, 453-468.
• [9] Rauszer C. and Skowron A. The discernibility matrices and functions in information systems. In: R. Słowiński (Ed.) Intelligent Decision Support - Handbook of Applications and Advances of the Rough Sets Theory, Knowledge Engineering and Problem Solving, vol. 11, 331-362, Kluwer Academic Publishers, Dordrecht, The Netherlands.
• [10] Vakarelov, D. Rough Polyadic Modal Logics, Journal of Applied Non-Classical Logics, vol 1.1 (1991),9-35