Tight Complexity Bounds for Reasoning in the Description Logic $\mathcal{BE{\kern-.1em}L}$.
Ismail Ilkan CeylanRafael PeñalozaPublished in: JELIA (2014)
Keyphrases
- description logics
- tight complexity bounds
- reasoning tasks
- reasoning systems
- reasoning problems
- knowledge base
- reasoning mechanism
- computational properties
- knowledge representation and reasoning
- knowledge representation
- reasoning services
- dl lite
- transitive closure of roles
- number restrictions
- computing least common subsumers
- decision procedures
- ontology reasoning
- semantic web ontologies
- refinement operators
- owl dl
- automated reasoning
- ontology languages
- query answering
- model theoretic
- conjunctive queries
- semantic web
- theorem proving
- special case
- database systems