Kryszkiewicz, Marzena; Rybinski, Henryk Computation of reducts of composed information systems. (English) Zbl 0854.68097 Ann. Soc. Math. Pol., Ser. IV, Fundam. Inf. 27, No. 2-3, 183-195 (1996). Summary: A set-theoretical approach to finding reducts of composed information systems is presented. It is shown how the search space can be represented in form of a pair of boundaries. It is also shown, how reducts of composing information systems can be used to reduce the search space of the composed system. Presented solutions are implied directly from the properties of composed monotonic Boolean functions. Cited in 7 Documents MSC: 68T30 Knowledge representation 06E30 Boolean functions Keywords:composed information systems PDF BibTeX XML Cite \textit{M. Kryszkiewicz} and \textit{H. Rybinski}, Ann. Soc. Math. Pol., Ser. IV, Fundam. Inf. 27, No. 2--3, 183--195 (1996; Zbl 0854.68097) OpenURL