Decomposition of relations and logical design of relational databases. II

The problem of logical design of a relational database is understood as that of search for possible decompositions of its universal relation. For the case where each assertion of integrity specifies a procedure for some decomposition of a universal relation a set of inference rules is specified for new decompositions which are included in the closure of the initial set of decomposition procedures.