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.
Type de document :
Communication dans un congrès
Steffen Hölldobler and Carsten Lutz and HeinrichWansing. 11th European Conference on Logics in Artificial Intelligence - JELIA 2008, Sep 2008, Dresden, Germany. Springer, 5293, pp.311-323, 2008, Lecture Notes in Artificial Intelligence. 〈10.1007/978-3-540-87803-2〉
Liste complète des métadonnées

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

Identifiants

Collections

Citation

Novak Novakovic. Proof-theoretic Approach to Deciding Subsumption and Computing Least Common Subsumer in EL w.r.t. Hybrid TBoxes. Steffen Hölldobler and Carsten Lutz and HeinrichWansing. 11th European Conference on Logics in Artificial Intelligence - JELIA 2008, Sep 2008, Dresden, Germany. Springer, 5293, pp.311-323, 2008, Lecture Notes in Artificial Intelligence. 〈10.1007/978-3-540-87803-2〉. 〈inria-00336704〉

Partager

Métriques

Consultations de la notice

102