A Proof-Theoretic Approach to Deciding Subsumption and Computing Least Common Subsumer in $\cal EL$ w.r.t. Hybrid TBoxes

Authors:
Novak Novaković
Affiliations:
Theoretical Computer Science, TU Dresden, Germany
Venue:
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Year:
2008

Citing 6
Cited 0

Proof-Theoretic Approach to Description-Logic

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Computing least common subsumers in description logics with existential restrictions

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Terminological cycles in a description logic with existential restrictions

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Pushing the EL envelope

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Subsumption in w.r.t. hybrid TBoxes

KI'05 Proceedings of the 28th annual German conference on Advances in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hybrid $\cal 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 $\cal EL$ w.r.t. hybrid TBoxes.