Semantic interpretation and matching of web services

4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A major issue in the study of semantic Web services concerns the matching problem of Web services. Various techniques for this problem have been proposed. Typical ones include FSM modeling, DAML-S ontology matching, description logics reasoning, and WSDL dual operation composition. They often assume the availability of concept semantic relations, based on which the capability satisfiability is evaluated. However, we find that the use of semantic relations alone in the satisfiability evaluation may lead to inappropriate results. In this paper, we study the problem and classify the existing techniques of satisfiability evaluation into three approaches, namely, set inclusion checking, concept coverage comparison and concept subsumption reasoning. Two different semantic interpretations, namely, capacity interpretation and restriction interpretation, are identified. However, each of the three approaches assumes only one interpretation and its evaluation is inapplicable to the other interpretation. To address this limitation, a novel interpretation model, called CRI model, is formulated. This model supports both semantic interpretations, and allows the satisfiability evaluation to be uniformly conducted. Finally, we present an algorithm for the unified satisfiability evaluation. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Xu, C., Cheung, S. C., & Xiao, X. (2004). Semantic interpretation and matching of web services. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3288, 542–554. https://doi.org/10.1007/978-3-540-30464-7_41

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free