On automating Web services discovery

On automating Web services discovery One of the challenging problems that Web service technology faces is the ability to effectively discover services based on their capabilities. We present an approach to tackling this problem in the context of description logics (DLs). We formalize service discovery as a new instance of the problem of rewriting concepts using terminologies. We call this new instance the best covering problem . We provide a formalization of the best covering problem in the framework of DL-based ontologies and propose a hypergraph-based algorithm to effectively compute best covers of a given request. We propose a novel matchmaking algorithm that takes as input a service request (or query) Q and an ontology $\mathcal{T}$ of services and finds a set of services called a “best cover” of Q whose descriptions contain as much common information with Q as possible and as little extra information with respect to Q as possible. We have implemented the proposed discovery technique and used the developed prototype in the context of the Multilingual Knowledge Based European Electronic Marketplace (MKBEEM) project. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png The VLDB Journal Springer Journals

On automating Web services discovery

, Volume 14 (1) – Mar 1, 2005
13 pages

/lp/springer_journal/on-automating-web-services-discovery-FaWQU7biSO
Publisher
Springer-Verlag
Subject
Computer Science; Database Management
ISSN
1066-8888
eISSN
0949-877X
D.O.I.
10.1007/s00778-003-0117-x
Publisher site
See Article on Publisher Site

Abstract

One of the challenging problems that Web service technology faces is the ability to effectively discover services based on their capabilities. We present an approach to tackling this problem in the context of description logics (DLs). We formalize service discovery as a new instance of the problem of rewriting concepts using terminologies. We call this new instance the best covering problem . We provide a formalization of the best covering problem in the framework of DL-based ontologies and propose a hypergraph-based algorithm to effectively compute best covers of a given request. We propose a novel matchmaking algorithm that takes as input a service request (or query) Q and an ontology $\mathcal{T}$ of services and finds a set of services called a “best cover” of Q whose descriptions contain as much common information with Q as possible and as little extra information with respect to Q as possible. We have implemented the proposed discovery technique and used the developed prototype in the context of the Multilingual Knowledge Based European Electronic Marketplace (MKBEEM) project.

Journal

The VLDB JournalSpringer Journals

Published: Mar 1, 2005

DeepDyve is your personal research library

It’s your single place to instantly
that matters to you.

over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month Explore the DeepDyve Library Search Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly Organize Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place. Access Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals. Your journals are on DeepDyve Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more. All the latest content is available, no embargo periods. DeepDyve Freelancer DeepDyve Pro Price FREE$49/month
\$360/year

Save searches from
PubMed

Create lists to

Export lists, citations