A Proof-Theoretic Subsumption Reasoner for Hybrid EL-TBoxes

Franz Baader Novak Novakovic 1 Boontawee Suntisrivaraporn
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Type de document :
Communication dans un congrès
21st International Workshop on Description Logics - DL 2008, May 2008, Dresden, Germany. 2008
Liste complète des métadonnées

https://hal.inria.fr/inria-00336702
Contributeur : Novak Novakovic <>
Soumis le : mardi 4 novembre 2008 - 17:48:41
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

Identifiants

  • HAL Id : inria-00336702, version 1

Collections

Citation

Franz Baader, Novak Novakovic, Boontawee Suntisrivaraporn. A Proof-Theoretic Subsumption Reasoner for Hybrid EL-TBoxes. 21st International Workshop on Description Logics - DL 2008, May 2008, Dresden, Germany. 2008. 〈inria-00336702〉

Partager

Métriques

Consultations de la notice

90