Conjunctive Query Inseparability in OWL 2 QL is ExpTime-hard.
Roman KontchakovVladislav RyzhikovMichael ZakharyaschevPublished in: Description Logics (2013)
Keyphrases
- conjunctive queries
- description logics
- query language
- ontology languages
- dl lite
- query containment
- data complexity
- exptime complete
- query answering
- inverse roles
- query evaluation
- np complete
- integrity constraints
- relational database theory
- owl ontologies
- semantic web
- owl dl
- knowledge representation
- knowledge base
- model theoretic
- decision procedures
- data exchange
- unions of conjunctive queries
- data model
- special case
- query rewriting
- probabilistic databases
- pspace complete
- acyclic conjunctive queries
- expressive power
- upper bound
- transitive closure
- reasoning problems
- conjunctive query containment
- database
- regular path queries
- data integration
- decision problems
- boolean expressions
- xml data
- bounded treewidth
- functional dependencies
- tuple generating dependencies
- first order logic
- normal form