Affiliations: Institute of Computer Science, University of Silesia,
B�dzińska 39, 41-200 Sosnowiec, Poland. E-mail: moshkov@us.edu.pl | Institute of Mathematics, Warsaw University, Banacha 2,
02-097 Warsaw, Poland. E-mail: skowron@mimuw.edu.pl | Chair of Computer Science, University of
Rzeszów, Rejtana 16A, 35-310 Rzeszów, Poland.
E-mail: zsuraj@univ.rzeszow.pl
Abstract: The minimal rules for information systems are often used for
inducing data models by methods in which the optimization of models is based on
the minimal length principle. We show that almost all information systems from
a certain large class of information systems have relatively short minimal
rules. However, the number of such rules is not polynomial in the number of
attributes and the number of objects. This class consists of all binary
information systems with the number of objects polynomial in the number of
attributes. Hence, for efficient inducing data models some filtration
techniques in rule generation are necessary. In our further study we would like
to extend our results for arbitrary information systems.
Keywords: Information systems, minimal rules, irreducible inconsistent systems of equations
