Complexity of Subsumption in the EL Family of Description Logics: Acyclic and Cyclic TBoxes

Authors:
Christoph Haase;Carsten Lutz
Affiliations:
University of Oxford, UK, christoph.haase@comlab.ox.ac.uk;TU Dresden, Germany, lutz@tcs.inf.tu-dresden.de
Venue:
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Year:
2008

Citing 7
Cited 11

Terminological reasoning is inherently intractable (research note)

Artificial Intelligence
Attributive concept descriptions with complements

Artificial Intelligence
The complexity of existential quantification in concept languages

Artificial Intelligence
The complexity of concept languages

Information and Computation
Containment and equivalence for an XPath fragment

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The description logic handbook: theory, implementation, and applications

The description logic handbook: theory, implementation, and applications
Terminological cycles in a description logic with existential restrictions

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

Semantic Modularity and Module Extraction in Description Logics

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Employing description logics in Ambient Intelligence for modeling and reasoning about complex situations

Journal of Ambient Intelligence and Smart Environments
Enriching EL-Concepts with Greatest Fixpoints

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Tractable reasoning in a fragment of separation logic

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Tractable Extensions of the Description Logic ${\mathcal{EL}}$ with Numerical Datatypes

Journal of Automated Reasoning
Tractable extensions of the description logic EL with numerical datatypes

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Employing description logics in Ambient Intelligence for modeling and reasoning about complex situations

Journal of Ambient Intelligence and Smart Environments
Applying semantic web technologies for diagnosing road traffic congestions

ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part II
Model-theoretic inseparability and modularity of description logic ontologies

Artificial Intelligence
Computing the stratified semantics of logic programs over big data through mass parallelization

RuleML'13 Proceedings of the 7th international conference on Theory, Practice, and Applications of Rules on the Web
Ontologies and terminologies: Continuum or dichotomy?

Applied Ontology - Ontologies and Terminologies: Continuum or Dichotomy?

Quantified Score

Hi-index	0.00

Visualization

Abstract

We perform an exhaustive study of the complexity of subsumption in the EL family of lightweight description logics w.r.t. acyclic and cyclic TBoxes. It turns out that there are interesting members of this family for which subsumption w.r.t. cyclic TBoxes is tractable, whereas it is EXPTIME-complete w.r.t. general TBoxes. For other extensions that are intractable w.r.t. general TBoxes, we establish intractability already for acyclic and cyclic TBoxes.