References
- Babin, M., and S. Kuznetsov. 2013. “Computing Premises of a Minimal Cover of Functional Dependencies is Intractable.” Discrete Applied Mathematics 161 (6): 742–749.
- Bazhanov, K., and S. Obiedkov. 2011. “Comparing Performance of Algorithms for Generating the Duquenne–Guigues Basis.” In Proceedings of the Eighth International Conference on Concept Lattices and their Applications, Nancy, France, October 17–20, 43–57.
- Beeri, C., and P. Bernstein. 1979. “Computational Problems Related to the Design of Normal Form Relational Schemas.” ACM Transactions on Database Systems (TODS) 4 (1): 30–59.
- Distel, F., and B. Sertkaya. 2011. “On the Complexity of Enumerating Pseudo-Intents.” Discrete Applied Mathematics 159 (6): 450–466.
- Ganter, B. 1984. Two Basic Algorithms in Concept Analysis. Darmstadt: Technische Hochschule. Preprint.
- Ganter, B., and R. Wille. 1999. Formal Concept Analysis – Mathematical Foundations. Springer.
- Guigues, J.-L., and V. Duquenne. 1986. “Familles minimales d’implications informatives résultant d’un tableau de données binaires.” Mathématiques et Sciences humaines 95: 5–18.
- Kuznetsov, S. 2004. “On the Intractability of Computing the Duquenne–Guigues Basis.” Journal of Universal Computer Science 10 (8): 927–933.
- Kuznetsov, S., and S. Obiedkov. 2008. “Some Decision and Counting Problems of the Duquenne–Guigues Basis of Implications.” Discrete Applied Mathematics 156 (11): 1994–2003.
- Obiedkov, S., and V. Duquenne. 2007. “Attribute-incremental Construction of the Canonical Implication Basis.” Annals of Mathematics and Artificial Intelligence 49 (1–4): 77–99.
- Valtchev, P., and V. Duquenne. 2008. “On the Merge of Factor Canonical Bases.” In Proceedings of Formal Concept Analysis, 6th International Conference, ICFCA 2008, Montreal, Canada, February 25–28, 182–198.