Abstract
In this paper we present a modal logic IND for Pawlak’s information systems giving a modal characterization of 9 informational relations: strong indiscernibility, as well as weak and strong versions of forward and backward informational inclusion, as well as positive and negative similarities. IND extends the logic INF introduced in [4] by adding a modality corresponding to strong indiscernibility relation. The main problem in the modal treating of strong indiscernibility is that its definition is not modally definable. This requires special copying techniques, which in the presence of many interacting modalities presents complications. One of the main aims of the paper is to demonstrate such techniques and to present an information logic complete in the intended semantics and containing almost all natural information relations. It is proved that IND possesses finite model property and hence is decidable.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
The work is carried out in the framework of COST Action 274 TARSKI on Theory and Applications of Relational Structures as Knowledge Instruments.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic, 53th edn. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (2001)
Demri, S., Orlowska, E.: Incomplete information: Structure, Inference, Complexity. Springer, Heidelberg (2002)
Orlowska, E., Pawlak, Z.: Representation of nondeterministic information. Theoretical Computer Science 29, 27–39 (1984)
Vakarelov, D.: A Duality Between Pawlak’s Knowledge Representation Systems and Bi-consequence Systems. Studia Logica 55, 205–228 (1995)
Vakarelov, D.: Information systems, similarity relations and modal logics. In: Orlowska, E. (ed.) Incomplete information: Rough Set Analysis. Studies in Fuzziness and Soft Computing, vol. 13. Phisica, Heidelberg (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
Vakarelov, D. (2005). A Modal Characterization of Indiscernibility and Similarity Relations in Pawlak’s Information Systems. 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_2
Download citation
DOI: https://doi.org/10.1007/11548669_2
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)