Logic on Similarity Based Rough Sets

Pawlak’s indiscernibility relation (which is an equivalence relation) represents a limit of our knowledge embedded in an information system. Covering approximation spaces generated by tolerance relations treat objects which are similar to a given object in the same way. Similarity based rough sets rely on the similarity of objects in general and preserve the benefit of pairwise disjoint system of base sets. By using correlation clustering not only a pairwise disjoint system of base sets can be generated but representative members of base sets can be defined. These representative members have an important logical usage. The author shows that there is a logical system relying on similarity base sets in which the truth values of first-order formulas can be counted in an effective simple way.

[1]  A. Mani,et al.  Choice inclusive general rough semantics , 2011, Inf. Sci..

[2]  Avrim Blum,et al.  Correlation Clustering , 2004, Machine Learning.

[3]  Dimiter Vakarelov,et al.  A Modal Characterization of Indiscernibility and Similarity Relations in Pawlak's Information Systems , 2005, RSFDGrC.

[4]  Tamás Mihálydeák,et al.  Partial First-order Logic with Approximative Functors Based on Properties , 2012, RSKT.

[5]  Tamás Mihálydeák,et al.  A General Set Theoretic Approximation Framework , 2012, IPMU.

[6]  Z. Pawlak.  Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .

[7]  Tamás Mihálydeák,et al.  From Vagueness to Rough Sets in Partial Approximation Spaces , 2014, RSEISP.

[8]  Ewa Orlowska,et al.  Logics of similarity and their dual tableaux. A survey , 2008 .

[9]  Jerzy W. Grzymala-Busse,et al.  Rough Sets , 1995, Commun. ACM.

[10]  Yiyu Yao,et al.  Covering based rough set approximations , 2012, Inf. Sci..

[11]  Andrzej Skowron,et al.  Tolerance Approximation Spaces , 1996, Fundam. Informaticae.

[12]  Tamás Mihálydeák,et al.  First-Order Logic Based on Set Approximation: A Partial Three-Valued Approach , 2014, 2014 IEEE 44th International Symposium on Multiple-Valued Logic.

[13]  Tamás Mihálydeák,et al.  Similarity Based Rough Sets , 2017, IJCRS.

[14]  Tamás Mihálydeák,et al.  Rough Clustering Generated by Correlation Clustering , 2013, RSFDGrC.

[15]  Andrzej Skowron,et al.  Rudiments of rough sets , 2007, Inf. Sci..

[16]  Davide Ciucci,et al.  On Definability and Approximations in Partial Approximation Spaces , 2014, RSKT.

[17]  Andrzej Skowron,et al.  Rough sets and Boolean reasoning , 2007, Inf. Sci..

[18]  Tamás Mihálydeák.  Aristotle's Syllogisms in Logical Semantics Relying on Optimistic, Average and Pessimistic Membership Functions , 2014, RSCTC.

[19]  Yiyu Yao,et al.  Probabilistic rough sets: Approximations, decision-makings, and applications , 2008, Int. J. Approx. Reason..