Information flow: the logic of distributed systems
Information flow: the logic of distributed systems
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
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
Handbook of Granular Computing
Handbook of Granular Computing
Two Families of Classification Algorithms
RSFDGrC '07 Proceedings of the 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
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
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
Contingency matrix theory: Statistical dependence in a contingency table
Information Sciences: an International Journal
Information Sciences: an International Journal
Transactions on rough sets XII
Positive approximation and converse approximation in interval-valued fuzzy rough sets
Information Sciences: an International Journal
Rule extraction based on granulation order in interval-valued fuzzy information system
Expert Systems with Applications: An International Journal
Synthesis of synchronized concurrent systems specified by information systems
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Irreducible descriptive sets of attributes for information systems
Transactions on Rough Sets XI
| Hi-index | 0.07 |
Knowledge encoded in information systems can be represented by different sets of rules generated by these systems. One can consider sets of deterministic, nondeterministic or probabilistic rules. Such sets of rules can be treated as theories of information systems. Any such a theory generated from a given information system corresponds to a subjective view on knowledge encoded in this information system. Such theories can be used for solving different problems. For example, the maximal consistent extensions of information systems were studied for synthesis of concurrent processes specified by information systems. In this approach, the maximal consistent extension of a given information system consists of all objects perceived by means of attributes which are consistent with the theory including all the so called true and realizable deterministic rules extracted from the original information system. In this paper, we report results on the maximal consistent extensions of information systems relative to some other theories of information systems, e.g., theories consisting of rules such as true and realizable inhibitory rules, true inhibitory rules, and true deterministic rules. We also discuss algorithmic problems related to the maximal consistent extensions. In particular, from the obtained results it follows that solutions based on these new sets of rules, e.g., on inhibitory rules can be of higher quality than in the case of deterministic rules.