Abstraction in Ontology-Based Data Management.

Intro
Title Page
Abstract
Acknowledgments
List of Publications
Contents
Introduction
Contributions of the Thesis
Structure of the Thesis
Theoretical Background
Relational Databases
Query Languages and Homomorphism
Computational Complexity
View-based Query Processing
Description Logic Ontologies and Knowledge Bases
Ontology-based Data Management
Abstraction in Ontology-based Data Management: Framework
The notion of Source-to-Ontology Rewriting
Computational Problems
Related Work
Dealing with Inequalities in Lightweight Description Logics
The Chase for Answering Queries with Inequalities
Answering CQ=,b over DL-LiteR knowledge bases
Answering UCQ=,bs over DL-LiteR knowledge bases
Answering UCQ=s over DL-LiteRDFS knowledge bases
Answering UCQ1,=s over DL-LiteRDFS knowledge bases
Containment of UCQ=s in Relational Databases
Complete Source-to-Ontology Rewritings
Verification Problem
Computation Problem
Improving by means of Inequalities
Dropping the UNA
Sound Source-to-Ontology Rewritings
Verification Problem
Computation Problem
Perfect Source-to-Ontology Rewritings
Verification Problem
Computation Problem
Sound Source-to-Ontology Rewritings in Restricted Scenarios
Restricted Scenario for UCQJFEs
Restricted Scenario for CQJFEs
Disjunctive Views in View-based Query Processing
Non-Monotonic Source-to-Ontology Rewritings
Towards EQL-Lite(UCQ) Abstractions
Non-existence of EQL-Lite(UCQ) S-to-O Rewritings
S-to-O Rewritings in a fragment of EQL-Lite(UCQ)
The case of One-To-One Mappings
Conclusions
Discussion
Future Work
Bibliography.