一种基于分块推理的语义Web服务合成方法  

A New Method of Web Service Composition Based on Patition-based Reasoning

作　　者：刘磊[1,2] 

机构地区：[1]同济大学计算机科学与技术系,上海201804 [2]德州学院计算机系,山东德州253023

出　　处：《同济大学学报（自然科学版）》2009年第4期540-544,共5页Journal of Tongji University:Natural Science

基　　金：国家自然科学基金资助项目(90412013;6047304;60534060)

摘　　要：将分块推理方法扩展到命题逻辑和描述逻辑的混合逻辑上,得出一种新的web服务合成方法.该方法可以方便地在UDDI(universal description,discovery and integration)之间的web服务之上进行合成,并有效结合了语义推理机,提高了算法的效率.为了把证明转化为可执行的过程,给出一种基于π演算的提取过程模型的方法,并为方便地利用语义推理机的语义关系,定义了一种伪过程以便统一地处理这种情况.Patition-based reasoning （PBR） is a method of reasoning with partitions of related logical axioms. A new method of web service composition based on MP algorithm is proposed for improving the composition of web services that is located in different UDDIs, and the performance of the semantic reasoner in the process of web service composition. Thus the new method proves more efficient than the one based on traditional theorem proving. A method of extracting the process model from proof based on the idea of n-calculus is also introduced. To make use of the subtype relation provided by semantic reasoner,a new process to handle this process is defined systematically.

关 键 词：WEB服务合成 语义推理 分块推理 消息传递 算法 

分 类 号：TP182[自动化与计算机技术—控制理论与控制工程]