检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安交通大学计算机系统结构与网络研究所,西安710049 [2]西安邮电学院计算机科学与技术系,西安710061
出 处:《Journal of Southeast University(English Edition)》2009年第4期464-467,共4页东南大学学报(英文版)
摘 要:In order to solve the problem that the current matchmaking methods for semantic web service mainly focus on the matchmaking of IO (inputs, outputs) descriptions which may result in one-sidedness, a description-logic-based IOPE (inputs, outputs, preconditions, effects) description and matchmaking method is proposed for semantic web service. The description logic concept is used to annotate service IO and the description logic assertion is employed to describe service PE(preconditions, effects). TBox subsumption checking is used to measure the subsumption relationship between IO descriptions of service request and advertising; ABox consistency checking is used for checking the logical implication between PE descriptions of service request and advertising. Based upon the logical implication, four kinds of PE matching degrees are proposed to measure and compare the pros and cons of the results of matchmaking. They are the exact, perfect, side-effect and common match. Experiments show that the method has a higher precision rate under the same recall rate compared with the existing method.为了解决语义Web服务匹配方法主要针对服务IO描述的匹配,导致匹配结果较为片面的问题,提出了一种基于描述逻辑的语义Web服务IOPE描述及匹配方法.具体使用描述逻辑概念标注服务IO,以描述逻辑断言库刻画服务PE.进行服务匹配时,利用描述逻辑TBox概念包含检测确定服务请求与广告IO之间的包含关系;利用描述逻辑ABox一致性检测推理,判断服务请求与广告PE之间的逻辑蕴含关系;依据此蕴含关系,将PE匹配情况划分为4种,即Exact,Perfect, Side-effect和Common匹配,用以对匹配结果进行有意义的排序.实验结果表明,所提方法在召回率与现有方法相当的情况下,具有更高的查准率.
关 键 词:capability matchmaking semantic web service precondition and effect
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.92