1. Babin, M., Kuznetsov, S.: Recognizing pseudo-intents is coNP-complete. In: Kryszkiewicz, M., Obiedkov, S. (eds.) Proc. of the 7th Int. Conf. on Concept Lattices and Their Applications, vol. 672. CEUR Workshop Proceedings (2010)
2. Bailey, J., Manoukian, T., Ramamohanarao, K.: A fast algorithm for computing hypergraph transversals and its application in mining emerging patterns. In: ICDM, pp. 485–488. IEEE Computer Society (2003)
3. Berge, C.: Hypergraphs—combinatorics of finite sets. North-Holland, Amsterdam (1989)
4. Bertet, K., Monjardet, B.: The multiple facets of the canonical direct unit implicational basis. Theor. Comput. Sci. 411(22–24), 2155–2166 (2010)
5. Borchmann, D.: Conexp-clj—a general-purpose tool for formal concept analysis. See http://www.math.tu-dresden.de/~borch/conexp-clj/