Abstract. We consider the problem of building Boolean rule sets in disjunctive normal form (DNF), an interpretable model for binary classification, subject to fairness constraints. We formulate the problem as an integer program that maximizes classification accuracy with explicit constraints on equality of opportunity and equalized odds metrics. A column generation framework is used to efficiently search over exponentially many possible rules, eliminating the need for heuristic rule mining.