On Irreducible Descriptive Sets of Attributes for Information Systems

  • Mikhail Moshkov
  • Andrzej Skowron
  • Zbigniew Suraj
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5306)


The maximal consistent extension Ext(S) of a given information system S consists of all objects corresponding to attribute values from S which are consistent with all true and realizable rules extracted from the original information system S. An irreducible descriptive set for the considered information system S is a minimal (relative to the inclusion) set B of attributes which defines exactly the set Ext(S) by means of true and realizable rules constructed over attributes from the considered set B. We show that there exists only one irreducible descriptive set of attributes. We also present a polynomial algorithm for this set construction. The obtained results will be useful for the design of concurrent data models from experimental data.


rough sets information systems maximal consistent extensions irreducible descriptive sets 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Delimata, P., Moshkov, M., Skowron, A., Suraj, Z.: Inhibitory Rules in Data Analysis. A Rough Set Approach. Springer, Heidelberg (in press, 2008)MATHGoogle Scholar
  2. 2.
    Düntsch, I., Gediga, G.: Algebraic Aspects of Attribute Dependencies in Information Systems. Fundamenta Informaticae 29(1-2), 119–134 (1997)MathSciNetMATHGoogle Scholar
  3. 3.
    Marek, W., Pawlak, Z.: Rough Sets and Information Systems. Fundamenta Informaticae 7(1), 105–116 (1984)MathSciNetMATHGoogle Scholar
  4. 4.
    Moshkov, M., Skowron, A., Suraj, Z.: On Testing Membership to Maximal Consistent Extensions of Information Systems. In: Greco, S., Hata, Y., Hirano, S., Inuiguchi, M., Miyamoto, S., Nguyen, H.S., Słowinski, R. (eds.) RSCTC 2006. LNCS (LNAI), vol. 4259, pp. 85–90. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  5. 5.
    Moshkov, M., Skowron, A., Suraj, Z.: On Maximal Consistent Extensions of Information Systems. In: Conference Decision Support Systems, Zakopane, Poland, December 2006, vol. 1, pp. 199–206. University of Silesia, Katowice (2007)Google Scholar
  6. 6.
    Moshkov, M., Skowron, A., Suraj, Z.: Maximal Consistent Extensions of Information Systems Relative to Their Theories. Information Sciences 178(12), 2600–2620 (2008)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Novotný, J., Novotný, M.: Notes on the Algebraic Approach to Dependence in Information Systems. Fundamenta Informaticae 16, 263–273 (1992)MathSciNetMATHGoogle Scholar
  8. 8.
    Pancerz, K., Suraj, Z.: Synthesis of Petri Net Models: A Rough Set Approach. Fundamenta Informaticae 55, 149–165 (2003)MathSciNetMATHGoogle Scholar
  9. 9.
    Pawlak, Z.: Information Systems: Theoretical Foundations. WNT, Warsaw (1983) (in Polish)MATHGoogle Scholar
  10. 10.
    Pawlak, Z.: Concurrent Versus Sequential – The Rough Sets Perspective. Bulletin of the EATCS 48, 178–190 (1992)MATHGoogle Scholar
  11. 11.
    Pawlak, Z.: Rough Sets – Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)MATHGoogle Scholar
  12. 12.
    Pawlak, Z., Rauszer, C.: Dependency of Attributes in Information Systems. Bull. Polish. Acad. Sci. Math. 9-10, 551–559 (1985)MathSciNetMATHGoogle Scholar
  13. 13.
    Pawlak, Z., Skowron, A.: Rudiments of Rough Sets. Information Sciences 177(1), 3–27 (2007); Rough Sets: Some Extensions. Information Sciences 177(1), 28–40 (2007); Rough Sets and Boolean Reasoning. Information Sciences 177(1), 41–73 (2007)Google Scholar
  14. 14.
    Rza̧sa, W., Suraj, Z.: A New Method for Determining of Extensions and Restrictions of Information Systems. In: Alpigini, J.J., Peters, J.F., Skowronek, J., Zhong, N. (eds.) RSCTC 2002. LNCS (LNAI), vol. 2475, pp. 197–204. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  15. 15.
    Skowron, A., Suraj, Z.: Rough Sets and Concurrency. Bulletin of the Polish Academy of Sciences 41, 237–254 (1993)MATHGoogle Scholar
  16. 16.
    Skowron, A., Suraj, Z.: Discovery of Concurrent Data Models from Experimental Tables: A Rough Set Approach. In: First International Conference on Knowledge Discovery and Data Mining, pp. 288–293. AAAI Press, Menlo Park (1995)Google Scholar
  17. 17.
    Skowron, A., Stepaniuk, J., Peters, J.F.: Rough Sets and Infomorphisms: Towards Approximation of Relations in Distributed Environments. Fundamenta Informaticae 54(1-2), 263–277 (2003)MathSciNetMATHGoogle Scholar
  18. 18.
    Ślȩzak, D.: Association Reducts: A Framework for Mining Multi-attribute Dependencies. In: Hacid, M.S., Murray, N.V., Ras, Z.W., Tsumoto, S. (eds.) ISMIS 2005. LNCS (LNAI), vol. 3488, pp. 354–363. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  19. 19.
    Suraj, Z.: Discovery of Concurrent Data Models from Experimental Tables: A Rough Set Approach. Fundamenta Informaticae 28, 353–376 (1996)MathSciNetMATHGoogle Scholar
  20. 20.
    Suraj, Z.: Some Remarks on Extensions and Restrictions of Information Systems. In: Ziarko, W., Yao, Y.Y. (eds.) RSCTC 2000. LNCS (LNAI), vol. 2005, pp. 204–211. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  21. 21.
    Suraj, Z., Pancerz, K.: A New Method for Computing Partially Consistent Extensions of Information Systems: A Rough Set Approach. In: 11th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, Editions E.D.K., Paris, vol. III, pp. 2618–2625 (2006)Google Scholar
  22. 22.
    Suraj, Z., Pancerz, K.: Reconstruction of Concurrent System Models Described by Decomposed Data Tables. Fundamenta Informaticae 71, 121–137 (2006)MathSciNetMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Mikhail Moshkov
    • 1
  • Andrzej Skowron
    • 2
  • Zbigniew Suraj
    • 3
  1. 1.Institute of Computer ScienceUniversity of SilesiaSosnowiecPoland
  2. 2.Institute of MathematicsWarsaw UniversityWarsawPoland
  3. 3.Chair of Computer ScienceUniversity of RzeszówRzeszówPoland

Personalised recommendations