@misc{ISO704,
  author = {of Standardization, International Organization},
  interhash = {c7b1e32acb1a58a39b2f083739f8568c},
  intrahash = {9f1dac9dfc14a47c968a0b54ea466566},
  title = {ISO 704. Terminology Work - Principles and Methods},
  year = 2000
}

@article{cimiano05learning,
  author = {Cimiano, Philipp and Hotho, Andreas and Staab, Steffen},
  date = {2007-07-26},
  ee = {http://www.jair.org/papers/paper1648.html},
  interhash = {4c09568cff62babd362aab03095f4589},
  intrahash = {eaaf0e4b3a8b29fab23b6c15ce2d308d},
  journal = {Journal on Artificial Intelligence Research},
  pages = {305-339},
  title = {Learning Concept Hierarchies from Text Corpora using Formal Concept Analysis},
  url = {http://dblp.uni-trier.de/db/journals/jair/jair24.html#CimianoHS05},
  volume = 24,
  year = 2005
}

@inbook{hesse04formal,
  author = {Hesse, Wolfgang and Tilley, Thomas Alan},
  booktitle = {Formal Concept Analysis: Foundations and Applications},
  editor = {Ganter, Bernhard and Stumme, Gerd and Wille, Rudolf},
  interhash = {54a13f608055c749302314b5c092fcc0},
  intrahash = {e1574155f034b66e6193cda6088481ab},
  pages = {288-303},
  publisher = {Springer},
  series = {LNAI },
  title = {Formal Concept Analysis used for Software Analysis and Modelling},
  volume = 3626,
  year = 2005
}

@inproceedings{gruber93towards,
  address = {Deventer, The Netherlands},
  author = {Gruber, Tom R.},
  booktitle = {Formal Ontology in Conceptual Analysis and Knowledge Representation},
  editor = {Guarino, N. and Poli, R.},
  interhash = {e606da18d41303247aa729faf2496301},
  intrahash = {5dd88ca177bfd0e4f57e567a56ad23d3},
  publisher = {Kluwer Academic Publishers},
  title = {Towards Principles for the Design of Ontologies
                  Used for Knowledge Sharing},
  year = 1993
}

@inproceedings{schmitz2006content,
  abstract = {Recently, research projects such as PADLR and SWAP
  have developed tools like Edutella or Bibster, which are targeted at
  establishing peer-to-peer knowledge management (P2PKM) systems.  In
  such a system, it is necessary to obtain provide brief semantic
  descriptions of peers, so that routing algorithms or matchmaking
  processes can make decisions about which communities peers should
  belong to, or to which peers a given query should be forwarded.

  This paper provides a graph clustering technique on
  knowledge bases for that purpose. Using this clustering, we can show
  that our strategy requires up to 58% fewer queries than the
  baselines to yield full recall in a bibliographic P2PKM scenario.},
  address = {Heidelberg},
  author = {Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd},
  booktitle = {The Semantic Web: Research and Applications},
  editor = {Sure, York and Domingue, John},
  interhash = {d2ddbb8f90cd271dc18670e4c940ccfb},
  intrahash = {1788c88e04112a4491f19dfffb8dc39e},
  pages = {530-544},
  publisher = {Springer},
  series = {LNAI},
  title = {Content Aggregation on Knowledge Bases using Graph Clustering},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/schmitz2006content.pdf},
  volume = 4011,
  year = 2006
}