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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00336702
Contributor : Novak Novakovic <>
Submitted on : Tuesday, November 4, 2008 - 5:48:41 PM
Last modification on : Thursday, January 11, 2018 - 6:19:48 AM

Identifiers

  • 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. ⟨inria-00336702⟩

Share

Metrics

Record views

115