Advertisement

Rough Logics with Possible Applications to Approximate Reasoning

  • Mihir Kr. Chakraborty
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5009)

Abstract

Representations of the lower and upper approximations of a set in the context of an approximation space as modal operators in the first order language of modal logics, are quite natural and widely familiar now to the rough-set community. According to the perception of an observer, objects of a universe (of discourse) are clustered. These are the basic information granules (or quanta). With respect to the information available, objects belonging to the same cluster are indistinguishable. It may not always be the case that the clusters are mutually disjoint.

References

  1. 1.
    Banerjee, M.: Logic for rough truth. Fund. Informaticae 71(2-3), 139–151 (2006)zbMATHGoogle Scholar
  2. 2.
    Banerjee, M., Chakraborty, M.K.: Rough consequence and rough algebra. In: Ziarko, W.P. (ed.) Rough Sets, Fuzzy Sets and Knowledge Discovery, Proc. RSKD 1993, pp. 196–207. Springer, London (1994)Google Scholar
  3. 3.
    Bunder, M.W.: Rough consequence and Jaśkowski’s D2 logics. Technical Report 2/04. School of Mathematics and Applied Statistics, University of Wollongong, Australia (2004)Google Scholar
  4. 4.
    Bunder, M.W., Banerjee, M., Chakraborty, M.K.: Some rough consequence logics and their interrelations. Transactions on Rough Sets (to appear)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Mihir Kr. Chakraborty
    • 1
  1. 1.Department of Pure MathematicsUniversity of CalcuttaCalcuttaIndia

Personalised recommendations