Skip to main content

A New Method for Determining of Extensions and Restrictions of Information Systems

  • Conference paper
  • First Online:
Rough Sets and Current Trends in Computing (RSCTC 2002)

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

Included in the following conference series:

Abstract

The aim of the paper is presentation of some results that concern consistent extensions and consistent restrictions of information systems and decision systems. It is possible to determine them on the base of knowledge contained in rules generated from a given information (decision) system. The paper presents a way of consistent extensions and consistent restrictions determining, different from the one mentioned above. The paper contains also the definitions of notions of strict consistent extension (restriction) system and a necessary and sufficient condition for the existence of them for information (decision) system.

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. Pawlak, Z.: Rough sets: Theoretical Aspects of Reasoning About Data, Boston, MA, Kluwer Academic Publishers, 1991

    MATH  Google Scholar 

  2. Suraj, Z.: Rough Set Methods for the Synthesis and Analysis of Concurrent Processes, in: Studies in Fuzziness and Soft Computing, Rough Set Methods and Applications. New Developments in Knowledge Discovery in Information Systems, L. Polkowski, S. Tsumoto, T.Y. Lin (Eds.), Physica-Verlag, Heidelberg, 2000, 379–488

    Google Scholar 

  3. Suraj, Z.: Some Remarks on Extensions and Restrictions of Information Systems. Proceedings of the Second International Conference on Rough Sets and Current Trends in Computing (RSCTC’2000), Banff, Canada, October 16–19, 2000, 172–179

    Google Scholar 

  4. Wegener, I.: The complexity of Boolean Functions, Wiley and B.G. Teubner Stuttgart 1987

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rzcasa, W., Suraj, Z. (2002). A New Method for Determining of Extensions and Restrictions of Information Systems. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds) Rough Sets and Current Trends in Computing. RSCTC 2002. Lecture Notes in Computer Science(), vol 2475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45813-1_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-45813-1_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44274-5

  • Online ISBN: 978-3-540-45813-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics