The reconciliation of Schematic Differences is an important and well studied problem of semantic interoperability. In this paper we focus on a class of schematic differences that arise when a binary relation is represented by means of a concept, possibly with two attributes, or by means of a binary predicate in two different ontologies. We extend the Distributed Description Logic formalism with “terminological” and “assertional” semantic mappings able to represent this class of schematic differences. We show that the unrestricted usage of these mapping originates an undecidable logic; we also show that under appropriate restrictions we recover from the undecidablity results, and we provide a forward propagation algorithm able to compute all, and only, the terminological and assertional knowledge which originates from the proposed semantic mappings.
Bridging Heterogeneous Representations of Binary Relations
Ghidini, Chiara;Serafini, Luciano;
2009-01-01
Abstract
The reconciliation of Schematic Differences is an important and well studied problem of semantic interoperability. In this paper we focus on a class of schematic differences that arise when a binary relation is represented by means of a concept, possibly with two attributes, or by means of a binary predicate in two different ontologies. We extend the Distributed Description Logic formalism with “terminological” and “assertional” semantic mappings able to represent this class of schematic differences. We show that the unrestricted usage of these mapping originates an undecidable logic; we also show that under appropriate restrictions we recover from the undecidablity results, and we provide a forward propagation algorithm able to compute all, and only, the terminological and assertional knowledge which originates from the proposed semantic mappings.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
