PTime Combined Complexity and FPT in Ontology-Mediated Querying.
Pablo BarcelóCristina FeierCarsten LutzAndreas PierisPublished in: Description Logics (2019)
Keyphrases
- data complexity
- combined complexity
- expressive power
- query language
- conjunctive queries
- query evaluation
- regular path queries
- transitive closure
- query answering
- exptime complete
- conjunctive regular path queries
- lower complexity
- graph databases
- description logics
- np complete
- semantic web
- domain ontology
- query processing
- databases
- query complexity
- knowledge base
- dl lite
- knowledge representation
- ontology languages
- database
- data exchange
- answering queries
- integrity constraints
- owl ontologies
- relational algebra
- artificial intelligence
- conp complete
- data integration
- query containment
- data model
- query optimization