Skip to Main content Skip to Navigation
Conference papers

Proof-theoretic Approach to Deciding Subsumption and Computing Least Common Subsumer in EL w.r.t. Hybrid TBoxes

Novak Novakovic 1
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, and present a proof-theoretic computation of least common subsumers in EL w.r.t. hybrid TBoxes.
Document type :
Conference papers
Complete list of metadatas

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

Identifiers

Collections

Citation

Novak Novakovic. Proof-theoretic Approach to Deciding Subsumption and Computing Least Common Subsumer in EL w.r.t. Hybrid TBoxes. 11th European Conference on Logics in Artificial Intelligence - JELIA 2008, Sep 2008, Dresden, Germany. pp.311-323, ⟨10.1007/978-3-540-87803-2⟩. ⟨inria-00336704⟩

Share

Metrics

Record views

141