@inproceedings{e878ffba5e2049308b6bfe985186d953,

title = "On irreducible descriptive sets of attributes for information systems",

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 = "Information systems, Irreducible descriptive sets, Maximal consistent extensions, Rough sets",

author = "Mikhail Moshkov and Andrzej Skowron and Zbigniew Suraj",

year = "2008",

doi = "10.1007/978-3-540-88425-5_3",

language = "English (US)",

isbn = "3540884238",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "21--30",

booktitle = "Rough Sets and Current Trends in Computing - 6th International Conference, RSCTC 2008, Proceedings",

address = "Germany",

note = "6th International Conference on Rough Sets and Current Trends in Computing, RSCTC 2008 ; Conference date: 23-10-2008 Through 25-11-2008",

}