关于Web服务动态组合的约束性满足的研究  

Constraint satisfaction in dynamic web services composition

作　　者：钱雪忠[1] 孙华峰[1] 贺庆和[2] 

机构地区：[1]江南大学信息工程学院,江苏无锡214122 [2]枣庄学院,山东枣庄277160

出　　处：《沈阳工业大学学报》2007年第3期326-329,共4页Journal of Shenyang University of Technology

基　　金：国家〈网络教育安全强认证技术〉专项基金资助项目(教技[2001]750号)

摘　　要：当前web服务组合已成为web services技术的一个重要方面,并且能够实时选择新的services以更好地满足人们的需求,这就需要制定自己web服务组合标准的方法.针对这一问题,描绘了引导服务选择的约束标准,根据这些标准能够选择一组较优的services进行组合,满足消费者的需求.这种方法使得动态web服务组合简化为一个约束满足的问题(CSP),因此,该机制成功地在服务组合模型上得到了实现.Web services composition is a crucial aspect of web services technology, and gives us the opportunity to select new services that best suit our needs at the moment. As a result, the automation of web services composition requires the criteria for composing candidate services. The criteria for selecting services were represented as constraints and an optimal set of services were chosen to satisfy the customer requirements. This approach reduces the dynamic composition of web services to a constraint satisfaction problem. The proposed method has been applied to the dynamic web services composition model successfully.

关 键 词：语义WEB 完全度 最小相似度 服务组合 约束满足 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]