Hal will be stopped for maintenance from friday on june 10 at 4pm until monday june 13 at 9am. More information
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 metadata

https://hal.inria.fr/inria-00336704
Contributor : Novak Novakovic Connect in order to contact the contributor
Submitted on : Tuesday, November 4, 2008 - 5:52:04 PM
Last modification on : Friday, February 4, 2022 - 3:23:42 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

61