Skip to main content

Antichain Based Semantics for Rough Sets

  • Conference paper
  • First Online:
Rough Sets and Knowledge Technology (RSKT 2015)

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

Included in the following conference series:

Abstract

The idea of using antichains of rough objects was suggested by the present author in her earlier papers. In this research basic aspects of such semantics are considered over general rough sets and general approximation spaces over quasi-equivalence relations. Most of the considerations are restricted to semantics associated with maximal antichains and their meaning. It is shown that even when the approximation operators are poorly behaved, some semantics with good structure and computational potential can be salvaged.

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

Access this chapter

Institutional subscriptions

References

  1. Gratzer, G.: General Lattice Theory. Birkhauser, Berlin (1998)

    MATH  Google Scholar 

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

    Book  Google Scholar 

  3. Mani, A.: Algebraic Semantics of Proto-Transitive Rough Sets. 1st edn., July 2014. arxiv:1410.0572

  4. Mani, A.: Approximation dialectics of proto-transitive rough sets. In: Chakraborty, M.K., Skowron, A., Kar, S. (eds.) Facets of Uncertainties and Applications. Springer Proceedings in Math and Statistics, vol. 125, pp. 99–109. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  5. Mani, A.: Dialectics of counting and the mathematics of vagueness. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets XV. LNCS, vol. 7255, pp. 122–180. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  6. Ciucci, D.: Approximation algebra and framework. Fundam. Informaticae 94, 147–161 (2009)

    MathSciNet  MATH  Google Scholar 

  7. Yao, Y.: Relational interpretation of neighbourhood operators and rough set approximation operators. Inf. Sci. 111, 239–259 (1998)

    Article  Google Scholar 

  8. Kung, J.P.S., Rota, G.C., Yan, C.H.: Combinatorics-The Rota Way. Cambridge University Press, Cambridge (2009)

    Book  Google Scholar 

  9. Koh, K.: On the lattice of maximum-sized antichains of a finite poset. Algebra Univers. 17, 73–86 (1983)

    Article  MathSciNet  Google Scholar 

  10. Siggers, M.: On the Representation of Finite Distributive Lattices. Mathematics 1, 1–17 (2014). arXiv:1412.0011

    Google Scholar 

  11. Bosnjak, I., Madarasz, R.: On some classes of good quotient relations. Novisad J. Math. 32(2), 131–140 (2002)

    MathSciNet  MATH  Google Scholar 

  12. Mani, A.: Algebraic semantics of similarity-based bitten rough set theory. Fundam. Informaticae 97(1–2), 177–197 (2009)

    MathSciNet  MATH  Google Scholar 

  13. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishers, Dodrecht (1991)

    Book  Google Scholar 

  14. Mani, A.: Towards logics of some rough perspectives of knowledge. In: Suraj, Z., Skowron, A. (eds.) Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam. Intelligent Systems Reference Library, vol. 43, pp. 342–367. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  15. Mani, A.: Choice inclusive general rough semantics. Inf. Sci. 181(6), 1097–1115 (2011)

    Article  MathSciNet  Google Scholar 

  16. Peters, J., Skowron, A., Stepaniuk, J.: Nearness of visual objects - application of rough sets in proximity spaces. Fundam. Informaticae 128, 159–176 (2013)

    MathSciNet  MATH  Google Scholar 

  17. Mani, A.: Esoteric rough set theory: algebraic semantics of a generalized VPRS and VPFRS. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets VIII. LNCS, vol. 5084, pp. 175–223. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  18. Chakraborty, M.K.: Membership function based rough set. Inf. Sci. 55, 402–411 (2014)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgement

The present author would like to thank the anonymous referees for useful remarks that led to improvement of the presentation of the paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. Mani .

Editor information

Editors and Affiliations

Rights and permissions

Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 2.5 International License (http://creativecommons.org/licenses/by-nc/2.5/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Mani, A. (2015). Antichain Based Semantics for Rough Sets. In: Ciucci, D., Wang, G., Mitra, S., Wu, WZ. (eds) Rough Sets and Knowledge Technology. RSKT 2015. Lecture Notes in Computer Science(), vol 9436. Springer, Cham. https://doi.org/10.1007/978-3-319-25754-9_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-25754-9_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-25753-2

  • Online ISBN: 978-3-319-25754-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics