Skip to main content
SpringerLink
Log in
Book cover

International Conference on Rough Sets and Current Trends in Computing

RSCTC 1998: Rough Sets and Current Trends in Computing pp 115–122Cite as

Approximation Spaces and Definability for Incomplete Information Systems

  • Conference paper
  • First Online:

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

Abstract

Incomplete information systems are approached here by general methods of rough set theory (see Pawlak [6,7]). We define approximation spaces of incomplete information systems and study definability and strong definability of sets of objects.

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   39.99
Price excludes VAT (USA)
  • Available as 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Blamey, Partial logic, in: D. Gabbay and F. Guenthner (eds.), Handbook of Philosophical Logic, vol. 3, D. Reidel, Dordrecht, 1986, 1–70.

    Google Scholar 

  2. L. Bolc and P. Borowik, Many-Valued Logics. 1. Theoretical Foundations, Springer, Berlin, 1992.

    MATH  Google Scholar 

  3. S. Demri and E. Orłowska, Logical Analysis of Indiscernibility, in: E. Orłowska (ed.), Incomplete Information: Rough Set Analysis, Physica-Verlag, Heidelberg, 1998, 347–380.

    Google Scholar 

  4. S.C. Kleene, Introduction to metamathematics, North-Holland, Amsterdam, 1952.

    MATH  Google Scholar 

  5. E. Orłowska and Z. Pawlak, Logical foundations of knowledge representation, ICS PAS Reports, 537, Warszawa, 1984.

    Google Scholar 

  6. Z. Pawlak, Information systems-theoretical foundations, Information Systems 6 (1981), 205–218.

    Article  MATH  Google Scholar 

  7. Z. Pawlak, Rough Sets. Theoretical Aspects of Reasoning about Data, Kluwer, Dordrecht, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Poznań, Poland

    Wojciech Buszkowski

Authors
  1. Wojciech Buszkowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics, Warsaw University of Technology, Pl. Politechniki 1, 00-665, Warszawa, Poland

    Lech Polkowski

  2. Institute of Mathematics, Warsaw University, Banacha 2, 02-097, Warszawa, Poland

    Andrzej Skowron

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Buszkowski, W. (1998). Approximation Spaces and Definability for Incomplete Information Systems. In: Polkowski, L., Skowron, A. (eds) Rough Sets and Current Trends in Computing. RSCTC 1998. Lecture Notes in Computer Science(), vol 1424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69115-4_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-69115-4_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64655-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation