Covering reduction is an efficient way of research on simplifying covering problem.

Considering the redundancy of the coverage to system,the rough entropy and granularity measure of coverage reduction to the incomplete information system is also defined,meanwhile,research results show that the uncertainty of coverage reduction is equivalence to that of knowledge when the classification of system reaches to an extreme value.

There is a NP-hard problem that derive the minimum coverage of multi-output logic circuit in two-level logic synthesis.

A minimum coverage method called CWSCM is presented to deal with complicated Web service composition.

A new classifying discrimination method different from the previous ones was put forward based on the principle of minimum coverage.

Design of City Environmental Information System Database and Its Minimal Cover;

Based on this, th e sufficient and necessary condition under which a set of GD-Constrai nts is a minimal cover is given.

This paper introduces a fast and effective logic syntheses arithmetic, to find the minimal cover of multi-input multi-output function with a method of expand cube.

The research of the algorithm of the minimum cover for XML;

Based on these theorems,gives the minimum cover algorith m of the multivalued dependency based on the MVD schema matrix.

The algorithm to find the minimum coverof MVD based on the inverse hypergraph of MVD is given also.