When DL-Lite met OWL...

The Ontology Alignment Evaluation Initiative(OAEI) is an international campaign for the systematic evaluation of ontology matching systems —software programs capable of finding

A consideration around the use of number restrictions (qualified or unqualified) regards their semantics: on the DL side, number restrictions, in- tended for possible infinite

The algorithm is based on a rewriting technique, and shows that query answering under the considered inconsistency-tolerant semantics in DL-Lite remains first-order rewritable,

Prexto is based on the query rewriting algorithm Presto [16]: with respect to the previous technique, Prexto has been designed to fully exploit the presence of extensional

In the sense that an attribute is really a kind of association (just as both data types and object types are properties), translating these kind of invariants is the same

To address these needs, the DL-Lite family of description logics has been proposed and investi- gated in [6–8, 16], with the aim of identifying a class of DLs that could capture

Specifically, we focus on DL-Lite A , the language in the DL-Lite family that is closest to OWL, and introduce the SparSQL language, a concrete epistemic query language, inspired

Structural similarity is computed by using linguistic similarity of the couple of nodes to align and the neighborhood structure.. Adjacent neighbor nodes of the entities are grouped