LATPub404

From International Center for Computational Logic

{{Publikation Details |Abstract=Hybrid EL-TBoxes combine general concept inclusions (GCIs), which are interpreted with descriptive semantics, with cyclic concept definitions, which are interpreted with greatest fixpoint (gfp) semantics. We introduce a proof-theoretic approach that yields a polynomial-time decision procedure for subsumption in EL w.r.t. hybrid TBoxes, and present preliminary experimental results regarding the performance of the reasoner Hyb that implements this decision procedure. |ISBN= |ISSN= |Link= |Download=BaaNovSun-DL-08.pdf |Slides= |DOI Name= |Projekt= |Forschungsgruppe=Automatentheorie |BibTex=@inproceedings{ BaaNovSun-DL-08,

 author = {Franz {Baader} and Novak {Novakovic} and Boontawee {Suntisrivaraporn} },
 booktitle = {Proceedings of the 2008 International Workshop on Description Logics ({DL2008})},
 series = {CEUR-WS},
 title = {A Proof-Theoretic Subsumption Reasoner for Hybrid $\mathcal{EL}$-{TBoxes} },
 volume = {353},
 year = {2008},

} }}