Boolean relation equations in data analysis

This paper discusses certain systems of Boolean relation equations with two unknown relations. It is shown that these systems have the greatest solutions, which are pairs of equivalences or quasi-orders, 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 data tables.