Notes on the algebraic approach to dependence in information systems
Fundamenta Informaticae
Discovery of concurrent data models from experimental tables: a rough set approach
Fundamenta Informaticae - Special issue: to the memory of Prof. Helena Rasiowa
Algebraic aspects of attribute dependencies in information systems
Fundamenta Informaticae
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Some Remarks on Extensions and Restrictions of Information Systems
RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
A New Method for Determining of Extensions and Restrictions of Information Systems
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Rough sets and infomorphisms: towards approximation of relations in distributed environments
Fundamenta Informaticae - Concurrency specification and programming
Synthesis of Petri net models: a rough set approach
Fundamenta Informaticae - Concurrency specification and programming
Reconstruction of concurrent system models described by decomposed data tables
Fundamenta Informaticae - Special issue on theory and applications of soft computing (TASC04)
Maximal consistent extensions of information systems relative to their theories
Information Sciences: an International Journal
On Irreducible Descriptive Sets of Attributes for Information Systems
RSCTC '08 Proceedings of the 6th International Conference on Rough Sets and Current Trends in Computing
Inhibitory Rules in Data Analysis: A Rough Set Approach
Inhibitory Rules in Data Analysis: A Rough Set Approach
On testing membership to maximal consistent extensions of information systems
RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
Association reducts: a framework for mining multi-attribute dependencies
ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems
A novel feature selection method and its application
Journal of Intelligent Information Systems
| Hi-index | 0.00 |
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 present a polynomial algorithm for this set construction. We also study relationships between the cardinality of irreducible descriptive set of attributes and the number of attributes in S. The obtained results will be useful for the design of concurrent data models from experimental data.