期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2014
卷号：69
期号：3
出版社：Journal of Theoretical and Applied
摘要：Discovery is one of the central reasoning tasks in SOA systems, concerned with the detection of usable Web services for a specific request or application con-text. Aiming at the automation of this task, most existing works on semantically enabled Web service discovery focus on the degree of match of two services based merely on their I/O pairs. Another approach for matchmaking in Semantic Web Services (SWS) that considers each service as a sub-graph of the semantic network of the ontology formed by inputs, outputs, pre and post-conditions with contribution of syntactical information such as keywords and textual descriptions. The similarity between services is defined as the similarity between these graphs (Behavior Graphs). This paper presents the detailed description of both approaches and it also analyses the advantages, disadvantages and retrieval effectiveness of these two matchmaking systems (I/O Mat, BEH Mat) and proposes new algorithm for semantic match making.
关键词：Semantic Web; Web Services; Matchmaking; Bipartite Graph; Behaviourally Correct Path; Critical Elements
