@inproceedings{mineau99conceptual,
  address = {Heidelberg},
  author = {Mineau, Guy and Stumme, Gerd and Wille, Rudolf},
  booktitle = {Conceptual Structures: Standards  and  Practices. Proc. ICCS '99},
  editor = {Tepfenhart, W. and Cyre, W.},
  interhash = {da964e12b882b59f6562a5e5ebb346ae},
  intrahash = {162279b2ef7ec69ab0bf0dc3a7b79b18},
  page = {318-331},
  pages = {423-441},
  publisher = {Springer},
  series = {LNAI},
  title = {Conceptual Structures  Represented by Conceptual Graphs and Formal Concept Analysis},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/1999/ICCS99.pdf},
  volume = 1640,
  year = 1999
}

@inproceedings{bastide00miningminimal,
  address = {Heidelberg},
  author = {Bastide, Y. and Pasquier, N. and Taouil, R. and Stumme, G. and Lakhal, L.},
  booktitle = {Computational Logic --- CL 2000 Proc. CL'00},
  editor = {Lloyd, J. and Dahl, V. and Furbach, U. and Kerber, M. and Laus, K.-K. and Palamidessi, C. and Pereira, L.M. and Sagiv, Y. and Stuckey, P.J.},
  interhash = {dc10d0ad3c40463f049ac775cb250f3d},
  intrahash = {25fa3431e7bdd7057f9b80a7385cd718},
  page = {972-986},
  publisher = {Springer},
  series = {LNAI},
  title = {Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/DOOD00.pdf},
  volume = 1861,
  year = 2000
}

@article{bastide00miningfrequent,
  author = {Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.},
  interhash = {86c9586115ef1c7ec8539257849d9842},
  intrahash = {1e79f8ba76044d2c78cea441eeba84aa},
  journal = {SIGKDD Explorations, Special Issue on Scalable Algorithms},
  number = 2,
  pages = {71-80},
  title = {Mining Frequent Patterns with Counting Inference.},
  volume = 2,
  year = 2000
}

@inproceedings{kuznetsov07reducing,
  address = {Berlin, Heidelberg},
  author = {Kuznetsov, Sergei and Obiedkov, Sergei and Roth, Camille},
  booktitle = {Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007)},
  crossref = {conf/iccs/2006},
  editor = {Priss, Uta and Polovina, Simon and Hill, Richard},
  interhash = {29e6d97fed3a32d028548c3f069936f1},
  intrahash = {ea581cd4026047bdf4dd0ab80ace7f28},
  isbn = {3-540-73680-8},
  month = {July},
  pages = {241-254},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Artificial Intelligence},
  title = {Reducing the Representation Complexity of Lattice-Based Taxonomies},
  volume = 4604,
  year = 2007
}

@article{davis93what,
  abstract = {Although knowledge representation is one of the central and in some ways most familiar concepts in AI, the most fundamental question about it---What is it?---has rarely been answered directly. Numerous papers have lobbied for one or another variety of representation, other papers have argued for various properties a representation should have, while still others have focused on properties that are important to the notion of representation in general. In this paper we go back to basics to...},
  author = {Davis, Randall and Shrobe, Howard E. and Szolovits, Peter},
  citeulike-article-id = {263073},
  interhash = {0a9d5e8f1265106c18730053f871e80b},
  intrahash = {079b3a9976c5dab9217465a1bb2d0bb5},
  journal = {AI Magazine},
  number = 1,
  pages = {17--33},
  priority = {0},
  title = {What Is a Knowledge Representation?},
  url = {http://citeseer.ist.psu.edu/davis93what.html},
  volume = 14,
  year = 1993
}