@INPROCEEDINGS { Rsds4462,
author = {Suraj, Zbigniew and Skowron, Andrzej and Moshkov, Mikhail}, 
title = {On Irreducible Descriptive Sets of Attributes for Information Systems}, 
booktitle = {Proceedings of the Sixth International Conference on Rough Sets and Current Trends in Computing (RSCTC'2008)}, 
conference = {Rough Sets and Current Trends in Computing}, 
series =  = {Lecture Notes in Artificial Intelligence}, 
volume = 5306, 
pages = {21--30}, 
publisher = {Springer-Verlag}, 
address = {Heidelberg - Berlin, Germany}, 
month = {November}, 
year = 2008, 
abstract = {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.}, 
keywords = {rough sets, information systems, maximal consistent extensions, irreducible descriptive sets, }, 
}