The complexity of Boolean functions
The complexity of Boolean functions
A parallel algorithm for real-time decision making: a rough set approach
Journal of Intelligent Information Systems
Discovery of concurrent data models from experimental tables: a rough set approach
Fundamenta Informaticae - Special issue: to the memory of Prof. Helena Rasiowa
Reconstruction of cooperative information systems under cost constraints: a rough set approach
Information Sciences—Informatics and Computer Science: An International Journal
An application of rough set methods in control design
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Machine Learning and Data Mining; Methods and Applications
Machine Learning and Data Mining; Methods and Applications
Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems
Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems
Rough-Fuzzy Hybridization: A New Trend in Decision Making
Rough-Fuzzy Hybridization: A New Trend in Decision Making
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
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
Transactions on rough sets XII
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
On Minimal Inhibitory Rules for Almost All k-Valued Information Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
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
Length and coverage of inhibitory decision rules
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II
| Hi-index | 0.00 |
Information systems (data tables) are often used to represent experimental data [4],[5],[8]. In [16] it has been pointed out that notions of extension and restriction of information system are crucial for solving different class of problems [6],[7],[10]-[11],[12]-[15]. The intent of this paper is to present some properties of an information system extension (restriction) and methods of their verification.