OTM
2005
Springer
13 years 9 months ago
2005
Springer
We view match as an operator that takes two graph-like structures (e.g., XML schemas) and produces a mapping between the nodes of these graphs that correspond semantically to each ...
DEXA
2005
Springer
13 years 10 months ago
2005
Springer
The first step in finding an efficient way to solve any difficult problem is making a complete, possibly formal, problem specification. This paper introduces a formal specifica...
WWW
2004
ACM
14 years 5 months ago
2004
ACM
In this paper, we address the problem of matching I/O descriptions of services to enable their automatic service composition. Specifically, we develop a method of semantic schema ...