Capturing complexity classes by fragments of second-order logic
Theoretical Computer Science - Special issue on logic and applications to computer science
Constraint query languages (preliminary report)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Resolution Strategies as Decision Procedures
Journal of the ACM (JACM)
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Enterprise integration with ERP and EAI
Communications of the ACM
A Portrait of the Semantic Web in Action
IEEE Intelligent Systems
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
ELP: Tractable Rules for OWL 2
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Datalog-based framework for efficient query answering over fuzzy ontologies
International Journal of Metadata, Semantics and Ontologies
| Hi-index | 0.00 |
We consider the problems of conjunctive query answering and rewriting for information integration systems in which a Description Logic ontology is used to provide a global view of the data. We present a resolution-based query rewriting algorithm for DL-Lite + ontologies, and use it to show that query answering in this setting is NLogSpace-complete with respect to data complexity. We also show that our algorithm produces an optimal rewriting when the input ontology is expressed in the language DL-Lite. Finally, we sketch an extended version of the algorithm that would, we are confident, be optimal for several DL languages with data complexity of query answering ranging from LogSpaceto PTime-complete.