Ontologies and Databases: The DL-Lite Approach

@inproceedings{Calvanese2009OntologiesAD,
  title={Ontologies and Databases: The DL-Lite Approach},
  author={Diego Calvanese and Giuseppe De Giacomo and Domenico Lembo and Maurizio Lenzerini and Antonella Poggi and Mariano Rodriguez-Muro and Riccardo Rosati},
  booktitle={Reasoning Web},
  year={2009}
}
Ontologies provide a conceptualization of a domain of interest. Nowadays, they are typically represented in terms of Description Logics (DLs), and are seen as the key technology used to describe the semantics of information at various sites. The idea of using ontologies as a conceptual view over data repositories is becoming more and more popular, but for it to become widespread in standard applications, it is fundamental that the conceptual layer through which the underlying data layer is… Expand
Managing Datatypes in Ontology-Based Data Access
Using ontologies for the conceptual modeling of a domain of interest is becoming increasingly popular, since ontologies have a formal semantics based on Description Logics (DLs), and since theyExpand
Query Answering over Description Logic Ontologies
TLDR
This work overviews here some of the key techniques developed in the last years for query answering over DL ontologies, ranging from rewriting based approaches for lightweight DLs, to tableaux algorithms, and techniques based on automata on infinite trees for very expressive DLs. Expand
Introducing Datatypes in DL-Lite
TLDR
This work establishes a theoretical framework for datatypes in the OBDA scenario, based on three major components: a DL, a class of datatype hierarchies, and a query language, and establishes the computational complexity of query answering for various significant instantiations of this framework, as ranging from FOL-rewritable to coNP in data complexity. Expand
Expressive Approximations in DL-Lite Ontologies
TLDR
This work presents the approach to semantic (as opposed to syntactic) approximation of OWL 2 T boxes by means of TBoxes in DL-LiteA, and provides an approximation algorithm and shows its soundness and completeness. Expand
Explaining Query Answers in Lightweight Ontologies
Accessing data through ontologies expressed in Description Logics (DL) is important for the realization of the Semantic Web. DL-LiteA, member of the DL-Lite family of DLs, is particularly suitableExpand
The MASTRO system for ontology-based data access
TLDR
MASTRO is a Java tool for ontology-based data access (OBDA) developed at Sapienza Universita di Roma and at the Free University of Bozen-Bolzano that provides optimized algorithms for answering expressive queries, as well as features for intensional reasoning and consistency checking. Expand
Web Semantics: Science, Services and Agents on the World Wide Web
TLDR
This paper provides a solution that allows query answering in data Integration systems under evolving ontologies without mapping redefinition by rewriting queries among ontology versions and then forwarding them to the underlying data integration systems to be answered. Expand
Ontology-based data access systems
  • M. Kogalovsky
  • Computer Science
  • Programming and Computer Software
  • 2012
TLDR
A survey of recent basic results and developments in the field of ontology description languages, which shows an acceptable compromise between their expressiveness, which remains sufficient for many applications, and computational complexity on ontologies and processing queries to data stored in large databases. Expand
Ontology evolution without tears
TLDR
This paper provides a solution that allows query answering in data Integration systems under evolving ontologies without mapping redefinition by rewriting queries among ontology versions and then forwarding them to the underlying data integration systems to be answered. Expand
On the feasibility of Description Logic knowledge bases with rough concepts and vague instances
  • C. Keet
  • Computer Science
  • Description Logics
  • 2010
A usage scenario of bio-ontologies is hypothesis testing, such as find- ing relationships or new subconcepts in the data linked to the ontology. Whilst validating the hypothesis, such knowledge isExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 167 REFERENCES
Linking Data to Ontologies: The Description Logic DL-Lite_A
TLDR
This paper proposes one such a fragment of OWL, in fact the largest fragment currently known to satisfy the above requirements, and proposes a suitable ontology-based data access model for relational DBMSs. Expand
Data Integration through DL-LiteA Ontologies
TLDR
This paper presents a comprehensive approach to, and a complete system for, ontology-based data integration, and shows that even very slight extensions of the expressive abilities of the system lead beyond this complexity bound. Expand
DL-Lite: Tractable Description Logics for Ontologies
TLDR
DL-Lite is proposed, a new Description Logic specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning, and shows that in DL-LITE the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is polynometric in theSize of the ABox, the first result of polynomic data complexity for query answering over DL knowledge bases. Expand
Data Integration throughDL-LiteA Ontologies
TLDR
This paper presents a comprehensive approach to, and a complete system for, ontology-based data integration, comprising a global schema, the source schema, and the mapping between the source and the global schema. Expand
QuOnto: Querying Ontologies
TLDR
The need of efficient reasoning algorithms is of paramount importance when the ontology system is to manage large amount of objects, as in the case of several important applications where the use of ontologies is advocated nowadays. Expand
DL-Lite in the Light of First-Order Logic
TLDR
This paper proposes DL-Litebool, an extension of DL- lite with full Booleans and number restrictions, and study the complexity of reasoning in DL- Litebool and its significant sub-logics, and obtains results by a novel reduction to the one-variable fragment of first-order logic. Expand
Description Logics for Information Integration
TLDR
This chapter illustrates how a logic of the Description Logics family is used to model a mediated schema of an integration system, to specify the semantics of the data sources, and finally to support the query answering process by means of the associated reasoning methods. Expand
Linking Data to Ontologies
TLDR
This paper presents a new ontology language, based on Description Logics, that is particularly suited to reason with large amounts of instances and a novel mapping language that is able to deal with the so-called impedance mismatch problem. Expand
Ontology Reasoning with Large Data Repositories
TLDR
This chapter presents the Semantic Business Process Repository (SBPR), and concludes that a RDBMS with the IRIS inference engine integrated is a suitable solution due to the expressiveness of the query language and the reasoning capability. Expand
On the Update of Description Logic Ontologies at the Instance Level
TLDR
This work provides a general semantics for instance level update in Description Logics, and shows that DL-Lite is closed with respect to instancelevel update, in the sense that the result of an update is always expressible as a new DL- lite ABox. Expand
...
1
2
3
4
5
...