Skip to main content

On Consistent and Partially Consistent Extensions of Information Systems

  • Conference paper
Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC 2005)

Abstract

Consistent extensions of information systems have been earlier considered in the literature. Informally, a consistent extension of a given information system includes only such objects corresponding to known attribute values which are consistent with the whole knowledge represented by rules extracted from the information system. This paper presents a new look at consistent extensions of information systems focusing mainly on partially consistent extensions and broadening the approach proposed earlier by Z. Suraj. To this end, a notion of a partially consistent extension of an information system is introduced. The meaning, properties and application examples of such extensions are given. In the approach presented, we admit the situation that some objects in an extension are consistent only with a part of the knowledge extracted from the information system. We show how a factor of consistency with the original knowledge for a given object from an extension can be computed. Some coefficients concerning rules in information systems are defined to compute a factor of consistency. The notions presented are crucial for solving different problems. An example is given in the paper to show an application of the proposed approach in modelling of concurrent systems described by information systems.

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. Kluwer Academic Publishers, Dordrecht (1991)

    MATH  Google Scholar 

  2. Rza̧sa, W., Suraj, Z.: A new method for determining of extensions and restrictions of information systems. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds.) RSCTC 2002. LNCS (LNAI), vol. 2475, pp. 197–204. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Suraj, Z.: Some remarks on extensions and restrictions of information systems. In: Ziarko, W.P., Yao, Y. (eds.) RSCTC 2000. LNCS (LNAI), vol. 2005, pp. 204–211. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Pancerz, K., Suraj, Z.: Synthesis of Petri net models: A rough set approach. Fundamenta Informaticae 55, 149–165 (2003)

    MATH  MathSciNet  Google Scholar 

  5. Suraj, Z.: Rough set methods for the synthesis and analysis of concurrent processes. In: Polkowski, L., Tsumoto, S., Lin, T.Y. (eds.) Rough Set Methods and Applications, pp. 379–488. Springer, Berlin (2000)

    Google Scholar 

  6. Skowron, A.: Boolean reasoning for decision rules generation. In: Komorowski, J., Raś, Z.W. (eds.) ISMIS 1993. LNCS, vol. 689, pp. 295–305. Springer, Heidelberg (1993)

    Google Scholar 

  7. Pawlak, Z.: Concurrent versus sequential - the rough sets perspective. Bull. of EATCS 48, 178–190 (1992)

    MATH  Google Scholar 

  8. Suraj, Z., Pancerz, K.: A synthesis of concurrent systems: A rough set approach. In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds.) RSFDGrC 2003. LNCS (LNAI), vol. 2639, pp. 299–302. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. Jensen, K.: Coloured Petri Nets. In: Basic Concepts, Analysis Methods and Practical Use, vol. 1. Springer, Berlin (1997)

    Google Scholar 

  10. Pancerz, K., Suraj, Z.: Discovering concurrent models from data tables with the ROSECON system. Fundamenta Informaticae 60, 251–268 (2004)

    MATH  MathSciNet  Google Scholar 

  11. Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Slowiński, R. (ed.) Intelligent Decision Support. Handbook of Applications and Advances of the Rough Set Theory, pp. 331–362. Kluwer Academic Publishers, Dordrecht (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Suraj, Z., Pancerz, K., Owsiany, G. (2005). On Consistent and Partially Consistent Extensions of Information Systems. In: Ślęzak, D., Wang, G., Szczuka, M., Düntsch, I., Yao, Y. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2005. Lecture Notes in Computer Science(), vol 3641. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11548669_24

Download citation

  • DOI: https://doi.org/10.1007/11548669_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28653-0

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics