Combined FO Rewritability for Conjunctive Query Answering in DL-Lite.
Roman KontchakovCarsten LutzDavid TomanFrank WolterMichael ZakharyaschevPublished in: Description Logics (2009)
Keyphrases
- conjunctive query answering
- description logics
- dl lite
- conjunctive queries
- first order logic
- data complexity
- expressive power
- combined complexity
- unions of conjunctive queries
- query answering
- exptime complete
- knowledge base
- query language
- knowledge representation
- ontology based data access
- semantic web
- ontology languages
- query evaluation
- data exchange
- transitive closure
- reasoning tasks
- integrity constraints
- inverse roles
- computational complexity
- np complete
- query complexity
- computational properties
- schema mappings
- decision procedures
- number restrictions
- query rewriting
- databases
- database