Mapping Validation by Probabilistic Reasoning

In the semantic web environment, where several independent ontologies are used in order to describe knowledge and data, ontologies have to be aligned by defining mappings among the elements of one ontology and the elements of another ontology. Very often, mappings are not derived from the semantics of the ontologies that are compared. Rather, mappings are computed by evaluating the similarity of the ontologies terminology and/or of their syntactic structure. In this paper, we propose a new mapping validation approach. The approach is based on the notion of probabilistic mappings and on the use of probabilistic reasoning techniques to enforce a semantic interpretation of similarity mappings as probabilistic and hypothetical relations among ontology elements.

[1]  Erhard Rahm,et al.  A survey of approaches to automatic schema matching , 2001, The VLDB Journal.

[2]  Volker Haarslev,et al.  A Generic Framework for Description Logics with Uncertainty , 2005, ISWC-URSW.

[3]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[4]  Daniel Lehmann,et al.  Another perspective on default reasoning , 1995, Annals of Mathematics and Artificial Intelligence.

[5]  Frank Wolter,et al.  Semi-qualitative Reasoning about Distances: A Preliminary Report , 2000, JELIA.

[6]  Volker Haarslev,et al.  Expressive ABox Reasoning with Number Restrictions, Role Hierarchies, and Transitively Closed Roles , 2000, KR.

[7]  Luciano Serafini,et al.  DRAGO: Distributed Reasoning Architecture for the Semantic Web , 2005, ESWC.

[8]  Manfred Jaeger,et al.  Probabilistic Reasoning in Terminological Logics , 1994, KR.

[9]  Thomas Lukasiewicz,et al.  P-SHOQ(D): A Probabilistic Extension of SHOQ(D) for Probabilistic Ontologies in the Semantic Web , 2002, JELIA.

[10]  Thomas Lukasiewicz,et al.  Expressive probabilistic description logics , 2008, Artif. Intell..

[11]  David C. Parkes,et al.  Chain: A Dynamic Double Auction Framework for Matching Patient Agents , 2007, J. Artif. Intell. Res..

[12]  Alon Y. Halevy,et al.  P-CLASSIC: A Tractable Probablistic Description Logic , 1997, AAAI/IAAI.

[13]  Yun Peng,et al.  A probabilistic extension to ontology language OWL , 2004, 37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the.

[14]  Silvana Castano,et al.  Matching Ontologies in Open Networked Systems: Techniques and Applications , 2006, J. Data Semant..

[15]  Luciano Serafini,et al.  Distributed Description Logics: Assimilating Information from Peer Sources , 2003, J. Data Semant..

[16]  Jochen Heinsohn,et al.  Probabilistic Description Logics , 1994, UAI.

[17]  Fausto Giunchiglia,et al.  S-Match: an Algorithm and an Implementation of Semantic Matching , 2004, ESWS.

[18]  Lora Aroyo,et al.  The Semantic Web: Research and Applications , 2009, Lecture Notes in Computer Science.

[19]  G. Stamou,et al.  Reasoning with Very Expressive Fuzzy Description Logics , 2007, J. Artif. Intell. Res..

[20]  Andrea Calì,et al.  A Framework for Representing Ontology Mappings under Probabilities and Inconsistency , 2007, URSW.

[21]  Heiner Stuckenschmidt,et al.  Reasoning about Ontology Mappings , 2005 .