Skip to main content

An Algebraic Semantics for the Logic of Multiple-Source Approximation Systems

  • Conference paper
Rough Sets, Fuzzy Sets, Data Mining and Granular Computing (RSFDGrC 2009)

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

Abstract

An algebraic semantics for the logic LMSAS, proposed to study the behavior of rough sets in multiple-source scenario, is presented. Soundness and completeness theorems are proved.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

  2. Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning About Knowledge. The MIT Press, Cambridge (1995)

    MATH  Google Scholar 

  3. Khan, M.A., Banerjee, M.: Formal reasoning with rough sets in multiple-source approximation systems. International Journal of Approximate Reasoning 49(2), 466–477 (2008)

    Article  MathSciNet  Google Scholar 

  4. Khan, M.A., Banerjee, M.: Multiple-source approximation systems: membership functions and indiscernibility. In: Wang, G., Li, T., Grzymala-Busse, J.W., Miao, D., Skowron, A., Yao, Y. (eds.) RSKT 2008. LNCS (LNAI), vol. 5009, pp. 80–87. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  5. Ono, H.: Completions of algebras and completeness of modal and substructural logics. In: Balbiani, P., Suzuki, N., Wolter, F., Zakharyaschev, Z. (eds.) Advances in Modal Logic, vol. 4, pp. 335–353. King’s College Publications (2003)

    Google Scholar 

  6. Orłowska, E., Pawlak, Z.: Expressive power of knowledge representation systems. International Journal of Man-Machine Studies 20(5), 485–500 (1984)

    Article  MATH  Google Scholar 

  7. Pawlak, Z.: Rough Sets. Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)

    MATH  Google Scholar 

  8. Rasiowa, H.: An Algebraic Approach to Non-classical Logics. North-Holland Publishing Company, Amsterdam

    Google Scholar 

  9. Rauszer, C.M.: Rough logic for multiagent systems. In: Masuch, M., Polos, L. (eds.) Logic at Work 1992. LNCS, vol. 808, pp. 161–181. Springer, Heidelberg (1994)

    Google Scholar 

  10. Tanaka, Y., Ono, H.: Rasiowa-Sikorski lemma and Kripke completeness of predicate and infinitary modal logics. In: Zakharyaschev, Z., Segerberg, K., de Rijke, M., Wansing, H. (eds.) Advances in Modal Logic, vol. 2, pp. 401–419. CSLI Publications, Stanford (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Khan, M.A., Banerjee, M. (2009). An Algebraic Semantics for the Logic of Multiple-Source Approximation Systems. In: Sakai, H., Chakraborty, M.K., Hassanien, A.E., Ślęzak, D., Zhu, W. (eds) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. RSFDGrC 2009. Lecture Notes in Computer Science(), vol 5908. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10646-0_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10646-0_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10645-3

  • Online ISBN: 978-3-642-10646-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics