Maximal consistent extensions of information systems

Pawel Delimata*, Mikhail Ju Moshkov, Andrzej Skowron, Zbigniew Suraj

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

5 Scopus citations


The idea of representation of concurrent system by information system is due to Z. Pawlak [61, 73, 74] In such a representation attributes are interpreted as local processes of a concurrent system, values of attributes - as states of local processes, and objects (tuples of values of attributes on objects) - as global states of the considered concurrent system. The knowledge encoded in an information system can be represented by means of true rules which can be extracted from the information system. Besides "explicit" global states, corresponding to objects, the concurrent system generated by the considered information system can also have "hidden" global states, i.e., tuples of attribute values not belonging to a given information system but consistent with all the rules. Such "hidden" states can also be considered as realizable global states. This was a motivation for introducing in [73] maximal consistent extensions of information systems with both "explicit" and "hidden" global states. The maximal consistent extensions of information systems relative to the set of true and realizable deterministic rules were investigated in [70, 73, 85, 86].

Original languageEnglish (US)
Title of host publicationInhibitory Rules in Data Analysis
Subtitle of host publicationA Rough Set Approach
EditorsPawel Delimata, Zbigniew Suraj, Mikhail Moshkov, Andrzej Skowron
Number of pages21
StatePublished - 2009

Publication series

NameStudies in Computational Intelligence
ISSN (Print)1860-949X

ASJC Scopus subject areas

  • Artificial Intelligence


Dive into the research topics of 'Maximal consistent extensions of information systems'. Together they form a unique fingerprint.

Cite this