语义Web中基于符号变换的次协调Tableau算法
A Paraconsistent Tableau Algorithm Based on Sign Transformation in Semantic Web
摘要:
在一个开放的,不断变化的和协作的环境,如即将到来的语义Web,这是合理的预期,知识来源将包含噪音和不准确性。作为语义Web的逻辑基础,描述逻辑缺乏对不一致或不完整数据的容忍能力。针对目前语义网中次协调方法推理能力较弱的问题,提出了一种基于符号变换的语义网tableau算法,该算法具有较强的推理能力。我们证明了该算法是可判定的,并且对于相容知识库,它具有与经典的Tableau算法相同的功能。
英文摘要:
In an open, constantly changing and collaborative environment like the forthcoming Semantic Web, it is reasonable to expect that knowledge sources will contain noise and inaccuracies. It is well known, as the logical foundation of the Semantic Web, description logic is lack of the ability of tolerating inconsistent or incomplete data. Recently, the ability of paraconsistent approaches in Semantic Web is weaker in this paper, we present a tableau algorithm based on sign transformation in Semantic Web which holds the stronger ability of reasoning. We prove that the tableau algorithm is decidable which hold the same function of classical tableau algorithm for consistent knowledge bases.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。