Computation Of Reducts Of Composed Information Systems

Authors:
Marzena Kryszkiewicz;Henryk Rybinski
Affiliations:
Institute of Computer Science, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warsaw, Poland;Institute of Computer Science, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warsaw, Poland
Venue:
Fundamenta Informaticae
Year:
1996

Citing 6
Cited 0

Expressive power of knowledge representation systems

International Journal of Man-Machine Studies
On the reduction of knowledge representation systems

6th Internation Workshop Vol. 1 on Expert Systems & Their Applications
Intelligent Decision Support: Handbook of Applications and Advances of the Rough Sets Theory

Intelligent Decision Support: Handbook of Applications and Advances of the Rough Sets Theory
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Combinatorial Algorithms: Theory and Practice

Combinatorial Algorithms: Theory and Practice
Acquisition of design knowledge from examples

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

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.