摘要
将分块推理方法扩展到命题逻辑和描述逻辑的混合逻辑上,得出一种新的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.
出处
《同济大学学报(自然科学版)》
EI
CAS
CSCD
北大核心
2009年第4期540-544,共5页
Journal of Tongji University:Natural Science
基金
国家自然科学基金资助项目(90412013
6047304
60534060)
关键词
WEB服务合成
语义推理
分块推理
消息传递
算法
web service compostion
semantic reasoning
partition-based reasoning
message passing algorithm