A modal characterization of indiscernibility and similarity relations in pawlak's information systems

Authors:
Dimiter Vakarelov
Affiliations:
Department of Mathematical Logic with Laboratory for Applied Logic, Faculty of Mathematics and Computer Science, Sofia University, Sofia, Bulgaria
Venue:
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
Year:
2005

Citing 2
Cited 2

Modal logic

Modal logic
Incomplete Information: Structure, Inference, Complexity

Incomplete Information: Structure, Inference, Complexity

Feature Selection Based on the Rough Set Theory and Expectation-Maximization Clustering Algorithm

RSCTC '08 Proceedings of the 6th International Conference on Rough Sets and Current Trends in Computing
Approximation of sets based on partial covering

Transactions on Rough Sets XVI

Quantified Score

Hi-index	0.00

Visualization

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.