header

Inconsistency-Tolerant Query Answering in Ontology-Based Data Access

70 Pages Posted: 8 Jul 2018 First Look: Accepted

See all articles by Domenico Lembo

Domenico Lembo

University of Rome I - Department of Computer, Control, and Management Engineering (DIAG)

Maurizio Lenzerini

University of Rome I - Department of Computer, Control, and Management Engineering (DIAG)

Riccardo Rosati

University of Rome I - Department of Computer, Control, and Management Engineering (DIAG)

Marco Ruzzi

University of Rome I - Department of Computer, Control, and Management Engineering (DIAG)

Domenico Fabio Savo

University of Rome I - Department of Computer, Control, and Management Engineering (DIAG)

Abstract

Ontology-based data access (OBDA) is receiving great attention as a new paradigm for managing information systems through semantic technologies. According to this paradigm, a Description Logic ontology provides an abstract and formal representation of the domain of interest to the information system, and is used as a sophisticated schema for accessing the data and formulating queries over them. In this paper, we address the problem of dealing with inconsistencies in OBDA. Our general goal is both to study DL semantical frameworks that are inconsistency-tolerant, and to devise techniques for answering unions of conjunctive queries under such inconsistency-tolerant semantics. Our work is inspired by the approaches to consistent query answering in databases, which are based on the idea of living with inconsistencies in the database, but trying to obtain only consistent information during query answering, by relying on the notion of database repair. We first adapt the notion of database repair to our context, and show that, according to such a notion, inconsistency-tolerant query answering is intractable, even for very simple DLs. Therefore, we propose a different repair-based semantics, with the goal of reaching a good compromise between the expressive power of the semantics and the computational complexity of inconsistency-tolerant query answering. Indeed, we show that query answering under the new semantics is first-order rewritable in OBDA, even if the ontology is expressed in one of the most expressive members of the DL-Lite family.

Keywords: Ontology-based data access, Inconsistency tolerance, DL-Lite, Query rewriting

Suggested Citation

Lembo, Domenico and Lenzerini, Maurizio and Rosati, Riccardo and Ruzzi, Marco and Fabio Savo, Domenico, Inconsistency-Tolerant Query Answering in Ontology-Based Data Access (2015). Journal of Web Semantics First Look. Available at SSRN: https://ssrn.com/abstract=3199186 or http://dx.doi.org/10.2139/ssrn.3199186

Domenico Lembo (Contact Author)

University of Rome I - Department of Computer, Control, and Management Engineering (DIAG) ( email )

Piazzale Aldo Moro, 5
Rome, 00185
Italy

Maurizio Lenzerini

University of Rome I - Department of Computer, Control, and Management Engineering (DIAG) ( email )

Piazzale Aldo Moro, 5
Rome, 00185
Italy

Riccardo Rosati

University of Rome I - Department of Computer, Control, and Management Engineering (DIAG)

Piazzale Aldo Moro, 5
Rome, 00185
Italy

Marco Ruzzi

University of Rome I - Department of Computer, Control, and Management Engineering (DIAG) ( email )

Piazzale Aldo Moro, 5
Rome, 00185
Italy

Domenico Fabio Savo

University of Rome I - Department of Computer, Control, and Management Engineering (DIAG) ( email )

Piazzale Aldo Moro, 5
Rome, 00185
Italy

Register to save articles to
your library

Register

Paper statistics

Abstract Views
125
Downloads
3