A Depth-first Search Algorithm for Computing Pseudo-closed Sets

Alexandre Bazin (1)

1 LIMOS - Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes

The question of the lower bounds for the delay in the computation of the Duquenne-Guigues implication basis in non-lectic orders is still open. As a step towards an answer, we propose an algorithm that can enumerate pseudo-closed sets in orders that do not necessarily extend the inclusion order using depth-first searches in a sequence of closure systems. Empirical comparisons with NextClosure on the runtime and number of closed sets computed are provided.

Domaines: Informatique [cs]; Mathématique discrète [cs.DM]

Alexandre Bazin. A Depth-first Search Algorithm for Computing Pseudo-closed Sets. Discrete Applied Mathematics, 2018. ⟨hal-01706373⟩