Skip to main content

Rough Logics with Possible Applications to Approximate Reasoning

  • Conference paper
Rough Sets and Knowledge Technology (RSKT 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5009))

Included in the following conference series:

  • 1507 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Banerjee, M.: Logic for rough truth. Fund. Informaticae 71(2-3), 139–151 (2006)

    MATH  Google Scholar 

  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. 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. Bunder, M.W., Banerjee, M., Chakraborty, M.K.: Some rough consequence logics and their interrelations. Transactions on Rough Sets (to appear)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Guoyin Wang Tianrui Li Jerzy W. Grzymala-Busse Duoqian Miao Andrzej Skowron Yiyu Yao

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chakraborty, M.K. (2008). Rough Logics with Possible Applications to Approximate Reasoning. In: Wang, G., Li, T., Grzymala-Busse, J.W., Miao, D., Skowron, A., Yao, Y. (eds) Rough Sets and Knowledge Technology. RSKT 2008. Lecture Notes in Computer Science(), vol 5009. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79721-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-79721-0_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-79720-3

  • Online ISBN: 978-3-540-79721-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics