@INPROCEEDINGS { Rsds4106,
author = {Suraj, Zbigniew and Skowron, Andrzej and Moshkov, Mikhail}, 
title = {On Testing Membership to Maximal Consistent Extensions of Information Systems}, 
booktitle = {Rough Sets and Current Trends in Computing}, 
conference = {Rough Sets and Current Trends in Computing}, 
series =  = {Lecture Notes in Artificial Intelligence}, 
volume = 4259, 
pages = {85--90}, 
publisher = {Springer-Verlag}, 
address = {Heidelberg - Berlin, Germany}, 
month = {November}, 
year = 2006, 
editor = {Greco, Salvatore and Hirano, Shoji and Inuiguchi, Masahiro and Miyamoto, Sadaaki and Nguyen,  Hung Son and Slowinski, Roman W.}, 
issn = {0302-9743}, 
isbn = {978-3-540-47693-1}, 
abstract = {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.}, 
keywords = {rough sets, information systems, maximal consistent extensions, }, 
}