The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...
This paper makes a case for the definition of a family of languages for expressing patterns over both the structure and semantics of source code. Our proposal is unique in that i...
We present a novel approach to describe and reason about stateless information processing services. It can be seen as an extension of standard descriptions which makes explicit th...
Duncan Hull, Evgeny Zolin, Andrey Bovykin, Ian Hor...
Several description frameworks to semantically describe and match services on the one hand and service requests on the other have been presented in the literature. Many of the curr...
In this paper, we propose an Internet public Web service matching approach that paves the way for (semi-)automatic service mashup. We will first provide the overview of the soluti...