Dynamic Description Logic Based on DL-Lite
Description logics offer considerable expressive power for describing knowledge about static application domains while reasoning is still decidable.The dynamic description logic DDL is a family of dynamic extensions of description logics for representing and reasoning about knowledge of dynamic application domains.In order to provide effective reasoning mechanisms, systems of DDL investigated in the literatures assume that there is no general concept inclusion(GCI) contained in the knowledge base.In this paper, we build a system of dynamic description logic based on the tractable description logic DL-LiteprR, in such a way that all the knowledge described by DL-LiteprR is supported by our system.A decision algorithm is provided for our system DDL-LiteprR.Termination and correctness of the algorithm are proved.
description logic dynamic description logic action theory satisfi-ability tableau algorithm
Na Zhang Liang Chang Zhoubo Xu Tianlong Gu
Guangxi Key Laboratory of Trusted Software, Guilin University of Electronic Technology,Guilin 541004, China
国际会议
8th International Conference on Intelligent Information Processing(2014年IFIP智能信息处理国际会议)
杭州
英文
171-177
2014-10-01(万方平台首次上网日期,不代表论文的发表时间)