CEL—A Polynomial-time Reasoner for Life Science Ontologies

Franz BaaderFranz Baader, Carsten LutzCarsten Lutz, B. SuntisrivarapornB. Suntisrivaraporn

Download

Franz Baader, Carsten Lutz, B. Suntisrivaraporn
CEL—A Polynomial-time Reasoner for Life Science Ontologies
In U. Furbach and N. Shankar, eds., Proceedings of the 3rd International Joint Conference on Automated Reasoning (IJCAR'06), volume 4130 of Lecture Notes in Artificial Intelligence, 287-291, 2006. Springer

Details
Bibtex

KurzfassungAbstract
CEL (Classifier for EL) is a reasoner for the small description logic EL+ which can be used to compute the subsumption hierarchy induced by EL+ ontologies. The most distinguishing feature of CEL is that, unlike other modern DL reasoners, it is based on a polynomial-time subsumption algorithm, which allows it to process very large ontologies in reasonable time. In spite of its restricted expressive power, EL+ is well-suited for formulating life science ontologies.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

The final publication is available at Springer.

@inproceedings{ BaaLutSun-IJCAR-06,
  author = {F. {Baader} and C. {Lutz} and B. {Suntisrivaraporn}},
  booktitle = {Proceedings of the 3rd International Joint Conference on Automated Reasoning ({IJCAR'06})},
  editor = {U. {Furbach} and N. {Shankar}},
  pages = {287--291},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Artificial Intelligence},
  title = {{\textsf{CEL}}---A Polynomial-time Reasoner for Life Science Ontologies},
  volume = {4130},
  year = {2006},
}