About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
AAAI-SS 2004
Conference paper
Semantic negotiation: Co-identifying objects across data sources
Abstract
Integrating and composing web services from different providers requires a solution for the problem of different providers using different names for the same object. We argue that while URIs might be adequate for creating shared namespaces for classes and property types, the practical difficulties associated with everyone using the same URI for individual objects makes exclusive dependence on this approach untenable. We first consider the use of shared keys to solve this matching problem and discuss some of the problems associated with this approach. We introduce the concept of DD, a generalization of keys and discuss some conditions under which common DDs guarantee correct matches. We then propose a probabilistic approach to matching and consider, with empirical validation, approximations as a solution to the problem of requiring a combinatorially large number of probabilities. Finally, we introduce Semantic Negotiation, a process by which two agents can negotiate a mutually comprehensible reference for an object.