The enumeration of pseudo-intents is a long-standing problem in which the order plays a major role. In this paper, we present newalgorithms that enumerate pseudo-intents in orders that do not necessarily respect the inclusion relation. We show that, confirming established results, this enumeration is equivalent to computing minimal transversals in hypergraphs a bounded number of times.

Keywords : Pseudo-Intents, Enumeration, Implications