Revisiting the Hardness of Query Answering in Expressive Description Logics.
Magdalena OrtizMantas SimkusPublished in: RR (2014)
Keyphrases
- expressive description logics
- query answering
- regular path queries
- data complexity
- exptime complete
- data exchange
- conjunctive queries
- description logics
- query containment
- incomplete information
- integrity constraints
- answering queries
- data integration
- dl lite
- query rewriting
- computational complexity
- phase transition
- np complete
- regular expressions
- datalog programs
- data management
- databases
- np hard
- owl dl
- database systems
- relational databases
- data model
- special case
- knowledge representation