Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Definability in Incomplete Information Tables

  • Conference paper
  • First Online:
Rough Sets (IJCRS 2016)

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

Included in the following conference series:

Abstract

This paper investigates the issues related to definability in an incomplete information table by using interval sets. We review the existing results pertaining to definability in a complete information table. We generalize the satisfiability of formulas in a description language in a complete table to a pair of strong and weak satisfiability of formulas in an incomplete table, which leads to an interval-set based interpretation of formulas. While we have definable sets in a complete table, we have definable interval sets in an incomplete table. The results are useful for studying concept analysis and approximations with incomplete tables.

M. Hu—Thanked FGSR at the University of Regina, Saskatchewan Innovation Scholarships and Mr. John Spencer Gordon Middleton for the support of this work.

Y. Yao—This work is partially supported by a Discovery Grant from NSERC, Canada.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Arnauld, A., Nicole, P.: Logic or the Art of Thinking. Cambridge University Press, Cambridge (1996). Buroker, J.V. (Trans.)

    Book  Google Scholar 

  2. Buroker, J.: Port Royal Logic. Stanford Encyclopedia of Philosophy. http://plato.stanford.edu/entries/port-royal-logic/. Accessed 16 May 2016

  3. Grzymala-Busse, J.W., Clark, P.G., Kuehnhausen, M.: Generalized probabilistic approximations of incomplete data. Int. J. Approximate Reasoning 55, 180–196 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  4. Grzymala-Busse, J.W.: A rough set approach to incomplete data. In: Ciucci, D., Wang, G.Y., Mitra, S., Wu, W.Z. (eds.) RSKT 2015. LNCS, vol. 9436, pp. 3–14. Springer, Heidelberg (2015). doi:10.1007/978-3-319-25754-9_1

    Chapter  Google Scholar 

  5. Lipski, W.: On semantics issues connected with incomplete information table. ACM Trans. Database Syst. 4, 262–296 (1979)

    Article  Google Scholar 

  6. Marek, W., Pawlak, Z.: Information storage and retrieval systems: mathematical foundations. Theoret. Comput. Sci. 1, 331–354 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  7. Pawlak, Z.: Rough sets. Int. J. Comput. Inf. Sci. 11, 341–356 (1982)

    Article  MathSciNet  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  9. van Mechelen, I., Hampton, J., Michalski, R.S., Theuns, P. (eds.): Categories and Concepts, Theoretical Views and Inductive Data Analysis. Academic Press, New York (1993)

    Google Scholar 

  10. Yao, Y.Y.: Interval-set algebra for qualitative knowledge representation. In: Proceedings of the Fifth International Conference on Computing and Information, pp. 370–374 (1993)

    Google Scholar 

  11. Yao, Y.Y.: A note on definability and approximations. In: Peters, J.F., Skowron, A., Marek, V.W., Orłowska, E., Słowiński, R., Ziarko, W.P. (eds.) Transactions on Rough Sets VII. LNCS, vol. 4400, pp. 274–282. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. Yao, Y.Y.: An outline of a theory of three-way decisions. In: Yao, J.T., Yang, Y., Słowiński, R., Greco, S., Li, H., Mitra, S., Polkowski, L. (eds.) RSCTC 2012. LNCS, vol. 7413, pp. 1–17. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  13. Yao, Y.Y.: The two sides of the theory of rough sets. Knowl. Based Syst. 80, 67–77 (2015)

    Article  Google Scholar 

  14. Yao, Y.Y.: Rough set approximations: a concept analysis point of view. In: Ishibuch, H. (ed.) Computational Intelligence - Volume I. Encyclopedia of Life Support Systems (EOLSS), pp. 282–296 (2015)

    Google Scholar 

  15. Yao, Y.Y., Hu, M.J.: A definition of structured rough set approximations. In: Kryszkiewicz, M., Cornelis, C., Ciucci, D., Medina-Moreno, J., Motoda, H., Raś, Z.W. (eds.) RSEISP 2014. LNCS, vol. 8537, pp. 111–122. Springer, Heidelberg (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Regina, Regina, SK, S4S 0A2, Canada

    Mengjun Hu & Yiyu Yao

Authors
  1. Mengjun Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yiyu Yao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Mengjun Hu or Yiyu Yao .

Editor information

Editors and Affiliations

  1. Universidad Católica del Norte, Antofagasta, Chile

    Víctor Flores

  2. University of Campinas, Campinas, SP, Brazil

    Fernando Gomide

  3. University of Warsaw, Warsaw, Poland

    Andrzej Janusz

  4. Universidad del Católica del Norte, Antofagasta, Chile

    Claudio Meneses

  5. Tongji University, Shanghai, China

    Duoqian Miao

  6. University of Applied Sciences, Munich, Germany

    Georg Peters

  7. University of Warsaw, Warsaw, Poland

    Dominik Ślęzak

  8. Chongqing University of Posts and Telecommunications, Chongqing, China

    Guoyin Wang

  9. Universidad de Chile, Santiago, Chile

    Richard Weber

  10. University of Regina, Regina, Saskatchewan, Canada

    Yiyu Yao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Hu, M., Yao, Y. (2016). Definability in Incomplete Information Tables. In: Flores, V., et al. Rough Sets. IJCRS 2016. Lecture Notes in Computer Science(), vol 9920. Springer, Cham. https://doi.org/10.1007/978-3-319-47160-0_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-47160-0_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-47159-4

  • Online ISBN: 978-3-319-47160-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation