---A Polynomial-time Reasoner for Life Science Ontologies |Year=2006 |Month= |Booktitle=Proceedings of the 3rd International Joint Conference on Automated Reasoning ({IJCAR'06}) |Editor=U. {Furbach} and N. {Shankar} |Note= |Organization= |Pages=287--291 |Publisher=Springer |Series=Lecture Notes in Artificial Intelligence |Volume=4130 |To appear=0 }}

{\textsf{CEL

F. BaaderF. Baader, C. LutzC. Lutz, B. SuntisrivarapornB. Suntisrivaraporn

${\textsf{CEL$

Download

F. Baader, C. Lutz, B. Suntisrivaraporn
{\textsf{CEL

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

@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},
}