Is Tractable Reasoning in Extensions of the Description Logic EL Useful in Practice?

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Toggle side column

Is Tractable Reasoning in Extensions of the Description Logic EL Useful in Practice?

Franz BaaderFranz Baader,  Carsten LutzCarsten Lutz,  Boontawee SuntisrivarapornBoontawee Suntisrivaraporn
Franz Baader, Carsten Lutz, Boontawee Suntisrivaraporn
Is Tractable Reasoning in Extensions of the Description Logic EL Useful in Practice?
Journal of Logic, Language and Information, Special Issue on Method for Modality (M4M), to appear
  • KurzfassungAbstract
    Extensions of the description logic EL have recently been proposed as lightweight ontology languages. The most important feature of these extensions is that, despite including powerful expressive means such as general concept inclusion axioms, reasoning can be carried out in polynomial time. In this paper, we consider one of these extensions, EL+, and introduce a refinement of the known polynomial-time classification algorithm for this logic. This refined algorithm was implemented in our CEL reasoner. We describe the results of several experiments with CEL on large ontologies from practice, which show that even a relatively straightforward implementation of the described algorithm outperforms highly optimized, state-of-the-art tableau reasoners for expressive description logics.
  • Bemerkung: Note: To appear
  • Forschungsgruppe:Research Group: Automatentheorie
@inproceedings{ BaaLutSun-JoLLI-07,
  author = {Franz {Baader} and Carsten {Lutz} and Boontawee {Suntisrivaraporn}},
  booktitle = {Journal of Logic, Language and Information, Special Issue on Method for Modality (M4M)},
  note = {To appear},
  title = {Is Tractable Reasoning in Extensions of the Description Logic $\mathcal{EL}$ Useful in Practice?},
  year = {2007},
}