Maximal consistent extensions of information systems relative to their theories

Abstract

Knowledge encoded in information systems can be represented by different sets of rules generated by these systems. One can consider sets of deterministic, nondeterministic or probabilistic rules. Such sets of rules can be treated as theories of information systems. Any such a theory generated from a given information system corresponds to a subjective view on knowledge encoded in this information system. Such theories can be used for solving different problems. For example, the maximal consistent extensions of information systems were studied for synthesis of concurrent processes specified by information systems. In this approach, the maximal consistent extension of a given information system consists of all objects perceived by means of attributes which are consistent with the theory including all the so called true and realizable deterministic rules extracted from the original information system. In this paper, we report results on the maximal consistent extensions of information systems relative to some other theories of information systems, e.g., theories consisting of rules such as true and realizable inhibitory rules, true inhibitory rules, and true deterministic rules. We also discuss algorithmic problems related to the maximal consistent extensions. In particular, from the obtained results it follows that solutions based on these new sets of rules, e.g., on inhibitory rules can be of higher quality than in the case of deterministic rules.