检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵晓非 史忠植[2] 田东平[2] 刘建伟 ZHAO Xiao-Fei;SHI Zhong-Zhi;TIAN Dong-Ping;LIU Jian-Wei(School of Computer Science and Technology,Tianjin Polytechnic University,Tianjin 300387,China;Key Laboratory of Intelligent Information Processing,Institute of Computing Technology,Chinese Academy of Sciences,Beijing 100190,China)
机构地区:[1]天津工业大学计算机科学与技术学院,天津300387 [2]中国科学院计算技术研究所智能信息处理重点实验室,北京100190
出 处:《软件学报》2020年第2期344-355,共12页Journal of Software
基 金:国家重点基础研究发展计划(973)(2013CB329502);国家自然科学基金(61035003);江苏省计算机信息处理技术重点实验室开放基金(KJS1737);陕西省科技厅工业攻关项目(2018GY-037).
摘 要:为了验证RDFS(resource description framework schema)本体的正确性所执行的推理是一项计算开销很大的任务,该任务在附加约束存在的条件下变得更加复杂.提出了一种旨在不改变推理结果的前提下,对RDFS模式进行抽取的方法.该方法基于对约束间的依赖关系进行分析.为了获取RDFS模式的精确语义,首先,将模式元素和约束形式化为一阶谓词逻辑中的析取嵌入依赖;接着,根据约束间的相互影响建立约束依赖图,在此基础上,提出了删除与推理任务无关的边和节点的策略;最后,通过重构造过程获取RDFS子模式.该方法使得推理验证可以在抽取后的小规模本体上进行.实验结果显示,该方法可以显著地提高RDFS本体验证过程的效率,抽取过程的平均耗时为0.60s,与推理检测时间相比几乎可以忽略,而获得的效率提升则为2.00倍~22.97倍不等.The reasoning performed to verify the correctness of the RDFS ontologies is the task with high computational cost.The task will become more complex in the scenario of existence of additional constraints.This paper presents an approach that can extract the RDFS schema without changing the reasoning results.This approach is based on the analysis of the dependency relationships between the constraints.To capture the precise semantics of the RDFS schema,firstly,the schema elements and the constraints are formalized into first-order formulas expressed as disjunctive embedded dependencies and the constraint depandency graph is established according to the interaction between the constraints.Then,the strategies for deleting the edges and the nodes that are irrelevant to the reasoning tasks are applied.Finally,the RDFS sub-schema is obtained through the reconstruction process.The proposed approach enables the reasoning to be carried out on the extracted small-scale ontologies.The experiment results show that the proposed approach can significantly improve the efficiency of the RDFS ontology validation.Compared to the reasoning time,the average time(0.60 s)consumed by the extraction process is almost negligible,while the efficiency increasement ranges from 2.00 times to 22.97 times.
关 键 词:RDFS(resource DESCRIPTION framework schema) 约束 本体抽取 依赖性分析
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.124