View-based query answering in Description Logics: Semantics and complexity.
Diego CalvaneseGiuseppe De GiacomoMaurizio LenzeriniRiccardo RosatiPublished in: J. Comput. Syst. Sci. (2012)
Keyphrases
- query answering
- transitive roles
- description logics
- dl lite
- complexity of query answering
- exptime complete
- conjunctive query answering
- data complexity
- double exponential
- ontology based data access
- query containment
- combined complexity
- data exchange
- model theoretic
- reasoning tasks
- ontology languages
- conjunctive queries
- inconsistent databases
- answering queries
- complexity bounds
- owl dl
- query answers
- integrity constraints
- tight complexity bounds
- incomplete information
- query rewriting
- knowledge base
- computational complexity
- computational properties
- owl ontologies
- formal semantics
- schema mappings
- data integration
- worst case
- inverse roles
- np complete
- conp complete
- unions of conjunctive queries
- expressive power
- regular path queries
- modal operators
- pspace complete
- knowledge representation
- logic programming
- operational semantics
- artificial intelligence
- tuple generating dependencies
- consistent query answering
- model checking
- conceptual model
- query evaluation