The complexity of Boolean functions
The complexity of Boolean functions
Rough set methods for the synthesis and analysis of concurrent processes
Rough set methods and applications
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
Synthesis of Petri net models: a rough set approach
Fundamenta Informaticae - Concurrency specification and programming
Discovering Concurrent Models from Data Tables with the ROSECON System
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Discovery of Asynchronous Concurrent Models from Experimental Tables
Fundamenta Informaticae - International Conference on Soft Computing and Distributed Processing (SCDP'2002)
Maximal consistent extensions of information systems relative to their theories
Information Sciences: an International Journal
Towards Efficient Computing Consistent and Partially Consistent Extensions of Information Systems
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
On Minimal Rule Sets for Almost All Binary Information Systems
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
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
Discovering Concurrent Process Models in Data: A Rough Set Approach
RSFDGrC '09 Proceedings of the 12th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
On Computing Extensions and Restrictions of Information Systems Noting Some Order Properties
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Irreducible descriptive sets of attributes for information systems
Transactions on Rough Sets XI
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 consistent and partially consistent extensions of information systems
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
Towards Efficient Computing Consistent and Partially Consistent Extensions of Information Systems
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
On Minimal Rule Sets for Almost All Binary Information Systems
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Discovering Concurrent Models from Data Tables with the ROSECON System
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Discovery of Asynchronous Concurrent Models from Experimental Tables
Fundamenta Informaticae - International Conference on Soft Computing and Distributed Processing (SCDP'2002)
Synthesis of Petri Net Models: A Rough Set Approach
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2
| Hi-index | 0.00 |
The aim of the paper is presentation of some results that concern consistent extensions and consistent restrictions of information systems and decision systems. It is possible to determine them on the base of knowledge contained in rules generated from a given information (decision) system. The paper presents a way of consistent extensions and consistent restrictions determining, different from the one mentioned above. The paper contains also the definitions of notions of strict consistent extension (restriction) system and a necessary and sufficient condition for the existence of them for information (decision) system.