CEL: a polynomial-time reasoner for life science ontologies

  • Authors:
  • Franz Baader;Carsten Lutz;Boontawee Suntisrivaraporn

  • Affiliations:
  • Theoretical Computer Science, TU Dresden, Germany;Theoretical Computer Science, TU Dresden, Germany;Theoretical Computer Science, TU Dresden, Germany

  • Venue:
  • IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
  • Year:
  • 2006
  • Pushing the EL envelope

    IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

Quantified Score

Hi-index 0.00

Visualization

Abstract

CEL (Classifier for ${\mathcal{E}{L}}$) is a reasoner for the small description logic ${\mathcal{E}{L}}^+$ which can be used to compute the subsumption hierarchy induced by ${\mathcal{E}{L}}^+$ ontologies. The most distinguishing feature of CEL is that, unlike all 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, ${\mathcal{E}{L}}^+$ is well-suited for formulating life science ontologies.