A Proof-Theoretic Subsumption Reasoner for Hybrid EL-TBoxes

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

Toggle side column

A Proof-Theoretic Subsumption Reasoner for Hybrid EL-TBoxes

Franz BaaderFranz Baader,  Novak NovakovicNovak Novakovic,  Boontawee SuntisrivarapornBoontawee Suntisrivaraporn
Franz Baader, Novak Novakovic, Boontawee Suntisrivaraporn
A Proof-Theoretic Subsumption Reasoner for Hybrid EL-TBoxes
Proceedings of the 2008 International Workshop on Description Logics (DL2008), volume 353 of CEUR-WS, 2008
  • KurzfassungAbstract
    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.
  • Forschungsgruppe:Research Group: Automatentheorie
@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},
}