Complexity of Subsumption in the [Escr ][Lscr ] Family of Description Logics: Acyclic and Cyclic TBoxes.
Christoph HaaseCarsten LutzPublished in: ECAI (2008)
Keyphrases
- description logics
- exptime complete
- knowledge base
- reasoning tasks
- knowledge representation
- computational properties
- dl lite
- semantic web
- concept descriptions
- ontology languages
- model theoretic
- ontology reasoning
- computing least common subsumers
- knowledge representation languages
- refinement operators
- reasoning problems
- owl dl
- description logic alc
- np hard
- combined complexity
- fuzzy description logics
- np complete
- worst case