模糊描述逻辑知识库查询蕴涵的判定方法
- 1、下载文档前请自行甄别文档内容的完整性,平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益,请联系客服反馈,我们会尽快为您处理(人工客服工作时间:9:00-18:30)。
模糊描述逻辑知识库查询蕴涵的判定方法
程经纬;马宗民;严丽;张富
【期刊名称】《计算机学报》
【年(卷),期】2012(035)004
【摘要】Recently, the rapid evolution of large-scale domain ontologies brought about higher requirements for data access in the Semantic Web community. The basic reasoning services for ontologies, however, cannot meet the needs of dealing with complex queries (mainly conjunctive queries) in data-intensive applications. For that purpose, significant research efforts are recently directed toward the design and implemrntatuon of query answering algorithms for ontologies and description logic (DL) knowledge bases (KBs). Many practical tools capable of storing a knowl-edge base, and also performing queries on it, were constructed. Fuzzy extensions to ontologies and DLs have recently gained considerable attention especially for the purposes of handling vague information in the Semantic Web. In this study, we focus on fuzzy conjunctive queries over fuzzy DL KBs of the expressive f-SH family. We show soundness, completeness and termination of fuzzy query entailment in proper sublogics of f-SHOXQ by providing a corresponding tableau-based algorithm. We show the algorithm is sound for f-SHOIQ, and analyse the reason leading to nontermintion. We close the open problem ot the complexity tor answering luzzy conjunctive queries in expressive
fuzzy description logics by establishing two complexity bounds; for data complexity, we prove a CONP upper bound, as long as only simple roles occur in the query; Re0-garding combined complexity, we prove a
CO3NEXPTIME upper bound in the size of the knowl-edge base and the query.%大规模领域本体的快速发展对语义Web领域的数据访问提出了更高的要求,而基本的本体推理服务已不能满足数据密集型应用中处理复杂查询(主要是合取查询)的迫切需要.为此,大量的研究工作集中在本体和描述逻辑知识库合取查询算法的设计实现上,并开发出了很多知识库存储和查询的实用工具.近来模糊本体和模糊描述逻辑的研究,特别是它们在处理语义Web中模糊信息方面,得到了广泛关注.文中重点研究了模糊SH这一族极富表达能力的描述逻辑知识库的合取查询问题,提出了相应的基于推演表的算法,证明了算法对于f-SHOIQ的真子逻辑的可靠性、完备性和可终止性.证明了算法对于f-SHOIQ是可靠的,并分析了导致算法不可终止的原因.对于该问题的数据复杂度,证明了当查询中不存在传递角色时其严格的CONP上限.对于联合复杂度,汪明了算法关于知识库和查询大小的CO3NEXPTIME 时间复杂度上限.
【总页数】19页(P767-785)
【作者】程经纬;马宗民;严丽;张富
【作者单位】东北大学信息科学与工程学院计算机应用技术研究所沈阳 110819;东北大学信息科学与工程学院计算机应用技术研究所沈阳 110819;东北大学软件学院软件工程研究所沈阳 110819;东北大学信息科学与工程学院计算机应用技术研究所沈阳 110819
【正文语种】中文
【中图分类】TP18
【相关文献】
1.朴素模糊描述逻辑知识库构造及其朴素推理 [J], 王蓁蓁
2.基于L*-值Luasiewicz蕴涵算子的直觉模糊推理全蕴涵方法 [J], 彭家寅
3.模糊描述逻辑f-DLR-Lite∩的合取查询回答 [J], 程经纬;马宗民;严丽;王海龙
4.多重模糊蕴涵与生成模糊蕴涵的新方法 [J], 李芳; 裴道武
5.基于修正的Kleene蕴涵的模糊描述逻辑 [J], 邱晓春; 裴道武
因版权原因,仅展示原文概要,查看原文内容请购买。