Tractable query answering and rewriting under description logic constraints.
Héctor Pérez-UrbinaBoris MotikIan HorrocksPublished in: J. Appl. Log. (2010)
Keyphrases
- query answering
- description logics
- conjunctive query answering
- dl lite
- conjunctive queries
- regular path queries
- transitive roles
- query rewriting
- tuple generating dependencies
- complexity of query answering
- data complexity
- query containment
- ontology languages
- exptime complete
- data exchange
- reasoning tasks
- integrity constraints
- tight complexity bounds
- np complete
- datalog programs
- incomplete information
- ontology based data access
- knowledge base
- inconsistent databases
- data integration
- computational complexity
- query evaluation
- answering queries
- query language
- reasoning problems
- query answers
- combined complexity
- knowledge representation
- unions of conjunctive queries
- computational properties
- number restrictions
- np hard
- special case
- owl ontologies
- regular expressions
- query optimization
- ontology mappings
- probabilistic databases
- query processing