Font Size: 

This paper discusses certain systems of relation equations with one or two unknown relations. It is shown that these systems have the greatest solutions, which are either equivalences or quasi-orders, or pairs of such relations, and are provided efficient algorithms for computing these greatest solutions. It is also shown how to use these equivalences and quasi-orders in the reduction of data represented by Boolean and data tables.