TY - GEN

T1 - Effective Computation of Maximal Sound Approximations of Description Logic Ontologies

AU - Console, Marco

AU - Mora, José

AU - Rosati, Riccardo

AU - Santarelli, Valerio

AU - Savo, Domenico Fabio

PY - 2014

Y1 - 2014

N2 - We study the problem of approximating Description Logic (DL) ontologies specified in a source language LSLS in terms of a less expressive target language LTLT. This problem is getting very relevant in practice: e.g., approximation is often needed in ontology-based data access systems, which are able to deal with ontology languages of a limited expressiveness. We first provide a general, parametric, and semantically well-founded definition of maximal sound approximation of a DL ontology. Then, we present an algorithm that is able to effectively compute two different notions of maximal sound approximation according to the above parametric semantics when the source ontology language is OWL 2 and the target ontology language is OWL 2 QL. Finally, we experiment the above algorithm by computing the two OWL 2 QL approximations of a large set of existing OWL 2 ontologies. The experimental results allow us both to evaluate the effectiveness of the proposed notions of approximation and to compare the two different notions of approximation in real cases.

AB - We study the problem of approximating Description Logic (DL) ontologies specified in a source language LSLS in terms of a less expressive target language LTLT. This problem is getting very relevant in practice: e.g., approximation is often needed in ontology-based data access systems, which are able to deal with ontology languages of a limited expressiveness. We first provide a general, parametric, and semantically well-founded definition of maximal sound approximation of a DL ontology. Then, we present an algorithm that is able to effectively compute two different notions of maximal sound approximation according to the above parametric semantics when the source ontology language is OWL 2 and the target ontology language is OWL 2 QL. Finally, we experiment the above algorithm by computing the two OWL 2 QL approximations of a large set of existing OWL 2 ontologies. The experimental results allow us both to evaluate the effectiveness of the proposed notions of approximation and to compare the two different notions of approximation in real cases.

U2 - 10.1007/978-3-319-11915-1_11

DO - 10.1007/978-3-319-11915-1_11

M3 - Conference contribution

SN - 978-3-319-11914-4

T3 - Lecture Notes in Computer Science (LNCS)

SP - 164

EP - 179

BT - The Semantic Web - ISWC 2014

PB - Springer International Publishing

ER -