COMPUTATION OF REDUCTS OF COMPOSED INFORMATION SYSTEMS

Article type: Research Article

Authors: Kryszkiewicz, Marzena | Rybinski, Henryk

Affiliations: Institute of Computer Science, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warsaw, Poland

Abstract: 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.

DOI: 10.3233/FI-1996-272306

Journal: Fundamenta Informaticae, vol. 27, no. 2-3, pp. 183-195, 1996