东篱科研大数据发现系统（DRDS）

位置：成果数据库 > 期刊 > 期刊详情页

基于动态描述逻辑的语义Web服务匹配研究

期刊名称：计算机研究与发展，已录用,2008
时间：0
分类：TP18[自动化与计算机技术—控制科学与工程;自动化与计算机技术—控制理论与控制工程]
作者机构：[1]中国科学院计算技术研究所智能信息处理重点实验室,北京100190, [2]湖南科技大学计算机科学与工程学院,湖南湘潭411201, [3]中国科学院研究生院,北京100049
相关基金：国家自然科学基金项目（60775035,90604017）;国家“九七三”重点基础研究发展规划基金项目（2003CB317004）
相关项目：基于感知学习和语言认知的智能计算模型

关键词：语义Web服务, 服务匹配, 描述逻辑, 动态描述逻辑, 动作, semantic Web service, service matching, description logic, dynamic description logic, action

中文摘要：

动态描述逻辑（dynamic description logic,DDL）是描述逻辑（description logic,DL）的一种动态扩展,它支持语义Web环境下对动作的描述和推理.提出了一种基于动态描述逻辑的语义Web服务描述与服务匹配方法：将服务需求方的目标服务以及服务发布方的原子服务用动态描述逻辑的动作进行描述,解决了语义Web服务的一致的形式化表述问题;将目标服务和原子服务的匹配问题归结为动态描述逻辑的公式可满足性判定问题,利用动态描述逻辑对动作的推理功能,发现与目标服务相匹配的原子服务组合.动态描述逻辑的公式可满足性问题是可判定的,解决了利用一阶谓词逻辑进行逻辑推理时的不可判定性.

英文摘要：

Dynamic description logic （DDL） is an extension of description logic （DL） with a dynamic dimension. In addition to the reasoning mechanism on static knowledge about application domains, DDL also provides a mechanism for representing and reasoning about actions by embracing knowledge of actions into DL. Therefore, DDL is a promising candidate for logic foundations of semantic Web service when every Web service is regarded as an action on Web. Due to such merits provided by DDL, the authors present a DDL-based approach for the description and matching of semantic Web services： Both the goal service of a service consumer and the atomic services from service provider are described in terms of actions of DDL. Then the matchmaker matches the goal service with supplied services by reasoning on actions. The match problem between goal service and supplied services is reduced to the satisfiability problem of formulas in DDL. Compared with the semantic Web service match method based on DL, the DDL based method describes both static information and actions on Web in a uniformal way and the reasoning problem on actions can be reduced to the satisfiability problem of formulas. Compared with the first-order predicate logic, which is often used in action reasoning in situation calculus, the satisfiability problem of formulas in DDL is decidable.

同期刊论文项目