Partial first-order logic relying on optimistic, pessimistic and average partial membership functions

One of the common features of decision‐theoretic rough set models is that they rely on total background (available) knowledge in the sense that the knowledge covers the discourse universe. In the proposed framework the author gives up this requirement and allows that available knowledge about the discourse universe may be partial. It is shown by introducing optimistic, average and pessimistic partial membership functions that a decision‐theoretic rough set model can be based on a very general version of partial approximation spaces. Dierent membership functions may serve as a base of the semantics of a partial first‐order logic. The proposed logical system gives an exact possibility to introduce dierent semantic notions of logical consequence relations which can be used in order to make clear the consequences of our decisions.

[1]  Ping Zhu,et al.  Covering rough sets based on neighborhoods: An approach without using neighborhoods , 2009, Int. J. Approx. Reason..

[2]  Janusz Zalewski,et al.  Rough sets: Theoretical aspects of reasoning about data , 1996 .

[3]  Ivo Düntsch,et al.  Approximation Operators in Qualitative Data Analysis , 2003, Theory and Applications of Relational Structures as Knowledge Instruments.

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

[5]  Andrzej Skowron,et al.  Approximation Spaces and Information Granulation , 2004, Trans. Rough Sets.

[6]  Yiyu Yao,et al.  Decision-Theoretic Rough Set Models , 2007, RSKT.

[7]  Tsau Young Approximation Theories: Granular Computing vs Rough Sets , 2008 .

[8]  Zoltán Csajbók,et al.  Partial approximative set theory: A generalization of the rough set theory , 2010, 2010 International Conference of Soft Computing and Pattern Recognition.

[9]  Zdzisław Pawlak,et al.  Rough Sets : An Approach to Vagueness , 2006 .

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

[11]  Yiyu Yao,et al.  On Generalizing Rough Set Theory , 2003, RSFDGrC.

[12]  L. Polkowski Rough Sets: Mathematical Foundations , 2013 .

[13]  Y. Yao Information granulation and rough set approximation , 2001 .

[14]  Sadaaki Miyamoto,et al.  Rough Sets and Current Trends in Computing , 2012, Lecture Notes in Computer Science.

[15]  Lotfi A. Zadeh Granular Computing and Rough Set Theory , 2007, RSEISP.

[16]  Zdzisław Pawlak,et al.  Rough sets: a new approach to vagueness , 1992 .

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

[18]  Andrzej Skowron,et al.  Information granules: Towards foundations of granular computing , 2001, Int. J. Intell. Syst..