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
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
Synthesis of Petri net models: a rough set approach
Fundamenta Informaticae - Concurrency specification and programming
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
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
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
| Hi-index | 0.00 |
This paper provides a new algorithm for testing membership to maximal consistent extensions of information systems. A maximal consistent extension of a given information system includes all objects corresponding to known attribute values which are consistent with all true and realizable rules extracted from the original information system. An algorithm presented here does not involve computing any rules, and has polynomial time complexity. This algorithm is based on a simpler criterion for membership testing than the algorithm described in [4]. The criterion under consideration is convenient for theoretical analysis of maximal consistent extensions of information systems.