Comparing Algorithms for Computing Lower Covers of Implication-closed Sets

In this paper, we consider two methods for computing lower cover of elements in closure systems for which we know an implicational basis: intersecting meet-irreducible elements or computing minimal transversals of sets of minimal generators. We provide experimental results on the runtimes for single computations of lower covers and depth-first searches.
Keywords : Pseudo-closed sets, Lattices, Lower covers, Implications