Skip to main content
SpringerLink
Log in
Book cover

International Conference on AI Logic and Applications

AILA 2022 2022: Artificial Intelligence Logic and Applications pp 166–179Cite as

Paraconsistent Rough Set Algebras

  • Conference paper
  • First Online:

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1657))

Abstract

Paraconsistent Pawlakian rough sets and paraconsistent covering based rough sets are introduced for modeling and reasoning about inconsistent information. Topological quasi-Boolean algebras are shown to be algebras for paraconsistent rough sets. We also give two sequent calculi as the modal systems for these paraconsistent rough sets.

This work was supported by Chinese National Funding of Social Sciences (Grant no. 18ZDA033).

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   84.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

Learn about institutional subscriptions

References

  1. Banerjee, M.: Rough sets and 3-valued lukasiewicz logic. Fundamenta Informaticae 31(3–4), 213–220 (1997). https://doi.org/10.3233/FI-1997-313401

    Article  MathSciNet  MATH  Google Scholar 

  2. Banerjee, M., Chakraborty, M.K.: Rough sets through algebraic logic. Fundamenta Informaticae 28(3–4), 211–221 (1996). https://doi.org/10.3233/FI-1996-283401

    Article  MathSciNet  MATH  Google Scholar 

  3. Belnap, N.D.: A useful four-valued logic. In: Dunn, J.M., Epstein, G. (eds.) Modern uses of Multiple-Valued Logic, pp. 5–37. Springer, Dordrecht (1977). https://doi.org/10.1007/978-94-010-1161-7_2

    Chapter  Google Scholar 

  4. Belnap, N.D.: How a computer should think. In: New Essays on Belnap-Dunn Logic. SL, vol. 418, pp. 35–53. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-31136-0_4

    Chapter  Google Scholar 

  5. Blackburn, P., De Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2002)

    MATH  Google Scholar 

  6. Bonikowski, Z., Bryniarski, E., Wybraniec-Skardowska, U.: Extensions and intentions in the rough set theory. Inf. Sci. 107(1–4), 149–167 (1998). https://doi.org/10.1016/S0020-0255(97)10046-9

    Article  MathSciNet  MATH  Google Scholar 

  7. Celani, S.A.: Classical modal de morgan algebras. Stud. Logica. 98, 251–266 (2011). https://doi.org/10.1007/s11225-011-9328-0

    Article  MathSciNet  MATH  Google Scholar 

  8. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (2002)

    Book  MATH  Google Scholar 

  9. Ma, M., Chakraborty, M.K.: Covering-based rough sets and modal logics. Part I. Int. J. Approximate Reasoning 77, 55–65 (2016). https://doi.org/10.1016/j.ijar.2016.06.002

    Article  MathSciNet  MATH  Google Scholar 

  10. Ma, M., Chakraborty, M.K.: Covering-based rough sets and modal logics. Part II. Int. J. Approximate Reasoning 95, 113–123 (2018). https://doi.org/10.1016/j.ijar.2018.02.002

    Article  MathSciNet  MATH  Google Scholar 

  11. Ma, M., Chakraborty, M.K., Lin, Z.: Sequent calculi for varieties of topological quasi-boolean algebras. In: Nguyen, H.S., Ha, Q.-T., Li, T., Przybyła-Kasperek, M. (eds.) IJCRS 2018. LNCS (LNAI), vol. 11103, pp. 309–322. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-99368-3_24

    Chapter  Google Scholar 

  12. Małuszyński, J., Szałas, A., Vitória, A.: A four-valued logic for rough set-like approximate reasoning. In: Peters, J.F., Skowron, A., Düntsch, I., Grzymała-Busse, J., Orłowska, E., Polkowski, L. (eds.) Transactions on Rough Sets VI. LNCS, vol. 4374, pp. 176–190. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-71200-8_11

    Chapter  MATH  Google Scholar 

  13. Małuszyński, J., Szałas, A., Vitória, A.: Paraconsistent logic programs with four-valued rough sets. In: Chan, C.-C., Grzymala-Busse, J.W., Ziarko, W.P. (eds.) RSCTC 2008. LNCS (LNAI), vol. 5306, pp. 41–51. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-88425-5_5

    Chapter  MATH  Google Scholar 

  14. Pawlak, Z.: Rough sets. Int. J. Comput. Inf. Sci. 11(5), 341–356 (1982). https://doi.org/10.1007/BF01001956

    Article  MATH  Google Scholar 

  15. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning About Data, vol. 9. Springer Science & Business Media, Berlin (1991)

    Book  MATH  Google Scholar 

  16. Samanta, P., Chakraborty, M.K.: Interface of rough set systems and modal logics: a survey. In: Peters, J.F., Skowron, A., Ślȩzak, D., Nguyen, H.S., Bazan, J.G. (eds.) Transactions on Rough Sets XIX. LNCS, vol. 8988, pp. 114–137. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-47815-8_8

    Chapter  Google Scholar 

  17. Sardar, M.R., Chakraborty, M.K.: Some implicative topological quasi-Boolean algebras and rough set models. Int. J. Approximate Reasoning 148, 1–22 (2022). https://doi.org/10.1016/j.ijar.2022.05.008

    Article  MathSciNet  MATH  Google Scholar 

  18. Slowinski, R., Vanderpooten, D.: A generalized definition of rough approximations based on similarity. IEEE Trans. Knowl. Data Eng. 12(2), 331–336 (2000). https://doi.org/10.1109/69.842271

    Article  Google Scholar 

  19. Vitória, A., Małuszyński, J., Szałas, A.: Modeling and reasoning with paraconsistent rough sets. Fundamenta Informaticae 97(4), 405–438 (2009). https://doi.org/10.3233/FI-2009-209

    Article  MathSciNet  MATH  Google Scholar 

  20. Vitória, A., Szałas, A., Małuszyński, J.: Four-valued extension of rough sets. In: Wang, G., Li, T., Grzymala-Busse, J.W., Miao, D., Skowron, A., Yao, Y. (eds.) RSKT 2008. LNCS (LNAI), vol. 5009, pp. 106–114. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-79721-0_19

    Chapter  MATH  Google Scholar 

  21. Yao, Y.Y.: On generalizing pawlak approximation operators. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol. 1424, pp. 298–307. Springer, Heidelberg (1998). https://doi.org/10.1007/3-540-69115-4_41

    Chapter  Google Scholar 

  22. Zhu, W.: Generalized rough sets based on relations. Inf. Sci. 177(22), 4997–5011 (2007). https://doi.org/10.1016/j.ins.2007.05.037

    Article  MathSciNet  MATH  Google Scholar 

  23. Zhu, W., Wang, F.Y.: Reduction and axiomization of covering generalized rough sets. Inf. Sci. 152, 217–230 (2003). https://doi.org/10.1016/S0020-0255(03)00056-2

    Article  MathSciNet  MATH  Google Scholar 

Download references

Ackonwledgements

The author thanks the anonymous reviewers for their helpful comments and suggestions.

Author information

Authors and Affiliations

  1. Institute of Logic and Cognition, Sun Yat-Sen University, Guangzhou, China

    Hao Wu

Authors
  1. Hao Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hao Wu .

Editor information

Editors and Affiliations

  1. East China Normal University, Shanghai, China

    Yixiang Chen

  2. Chinese Academy of Sciences, Beijing, China

    Songmao Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wu, H. (2022). Paraconsistent Rough Set Algebras. In: Chen, Y., Zhang, S. (eds) Artificial Intelligence Logic and Applications. AILA 2022 2022. Communications in Computer and Information Science, vol 1657. Springer, Singapore. https://doi.org/10.1007/978-981-19-7510-3_13

Download citation

  • DOI: https://doi.org/10.1007/978-981-19-7510-3_13

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-19-7509-7

  • Online ISBN: 978-981-19-7510-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation