Abstract
Matchmaking is an important aspect of the Web Services interactions, which enables a service requester to locate the most suitable counterpart. However, current service matching algorithms operate on service advertisements, which don't contain enough information to select a service instance that the consumer can immediately interact with. In this paper, we propose a precise matching algorithm, based on WS-Agreement and OWL-S, to deal with this challenge. We show how to combine WS-Agreement with OWL-S to obtain an agreement-style service description, and how the degree of match between two descriptions of this style is calculated 1. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Yao, Y., Su, S., & Yang, F. (2006). Precise matching of semantic web services. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3994 LNCS-IV, pp. 164–167). Springer Verlag. https://doi.org/10.1007/11758549_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
