首页> 外文会议>2010 International Conference on Management and Service Science >An Algorithm for SWS Matching Based on Subsumption Relation Defined in Domain Ontology
【24h】

An Algorithm for SWS Matching Based on Subsumption Relation Defined in Domain Ontology

机译:基于领域本体中定义的包含关系的SWS匹配算法

获取原文

摘要

Semantic Web Services (SWS) is proposed to ensure Web Service core missions automation, nevertheless, a dedicated Web Service discovery technology based on SWS is desired currently. For this reason, we propose an effective SWS matching algorithm to achieve service discovery based on semantics. In the paper, we first refine core properties and requirements to apply subsumption relation to involved SWS matching method, which is based on the semantic information of service's inputs and outputs. Then, we discuss a feasible service semantic matching algorithm in detail. Next, we implement and test it in related SWS registry. Finally, we point out its main properties. In fact, the algorithm proves to fully satisfy our expectations and be practical and feasible.
机译:提出了语义Web服务(SWS)以确保Web服务核心任务自动化,但是,目前需要一种基于SWS的专用Web服务发现技术。因此,我们提出了一种有效的SWS匹配算法,以基于语义实现服务发现。在本文中,我们首先根据服务输入和输出的语义信息,细化核心属性和需求,以将包含关系应用于所涉及的SWS匹配方法。然后,详细讨论了一种可行的服务语义匹配算法。接下来,我们在相关的SWS注册中心中实施和测试它。最后,我们指出了它的主要属性。实际上,该算法被证明可以完全满足我们的期望并且是实用可行的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号