A Modal Logic for Similarity Relations in Pawlak Knowledge Representation Systems
Dimiter Vakarelov · Fundamenta Informaticae · 1991
One of the main results of the paper is a characterization of certain kind similarity relations in Pawlak knowledge representation systems by means of first order sentences. As an application we obtain a complete finite axiomatization of the corresponding poly modal logic, called in the paper MLSim. It is proved that MLSim possesses finite model property and is decidable.