Title: decidable temporal dynamic description logic
Author: Chang Liang
; Shi Zhong-Zhi
; Gu Tian-Long
; Wang Xiao-Feng
Keyword: Algorithms
; Computability and decidability
; Data description
; Formal languages
; Knowledge representation
; Semantic Web
; Semantics
; User interfaces
Source: Ruan Jian Xue Bao/Journal of Software
Issued Date: 2011
Volume: 22, Issue: 7, Pages: 1524-1537 Indexed Type: EI
Department: (1) Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin 541004 China; (2) Key Laboratory of Intelligent Information Processing Institute of Computing Technology The Chinese Academy of Sciences Beijing 100190 China
Abstract: The dynamic description logic DDL (dynamic description logic) provides a kind of action theory based on description logics. It is a useful representation of the dynamic application domains in the environment of the Semantic Web. In order to bring the representation capability of the branching temporal logic into the dynamic description logic, this paper treats the time slices of temporal logics as the executions of atomic actions, so that the temporal dimension and the dynamic dimension can be unified. Based on this idea, constructed over the description logic ALCQIO, a temporal dynamic description logic, named TDALCQIO , is presented. Tableau decision algorithm is provided for TDALCQIO . Both the termination and the correctness of this algorithm have been proved. The logic TDALCQIO not only inherits the representation capability provided by the dynamic description logic constructed over ALCQIO (attributive language with complements, qualified number restrictions, inverse roles and nominals), but it also has the ability to describe and reason about some temporal features such as the reachability property and the safety property of the whole dynamic application domains. Therefore, TDALCQIO provides further support for knowledge representation and reasoning in the environment of the Semantic Web. © Copyright 2011, Institute of Software, the Chinese Academy of Sciences. English Abstract: The dynamic description logic DDL (dynamic description logic) provides a kind of action theory based on description logics. It is a useful representation of the dynamic application domains in the environment of the Semantic Web. In order to bring the representation capability of the branching temporal logic into the dynamic description logic, this paper treats the time slices of temporal logics as the executions of atomic actions, so that the temporal dimension and the dynamic dimension can be unified. Based on this idea, constructed over the description logic ALCQIO, a temporal dynamic description logic, named TDALCQIO , is presented. Tableau decision algorithm is provided for TDALCQIO . Both the termination and the correctness of this algorithm have been proved. The logic TDALCQIO not only inherits the representation capability provided by the dynamic description logic constructed over ALCQIO (attributive language with complements, qualified number restrictions, inverse roles and nominals), but it also has the ability to describe and reason about some temporal features such as the reachability property and the safety property of the whole dynamic application domains. Therefore, TDALCQIO provides further support for knowledge representation and reasoning in the environment of the Semantic Web. © Copyright 2011, Institute of Software, the Chinese Academy of Sciences. Language: 中文
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/16160
Appears in Collections: 软件所图书馆_期刊论文
There are no files associated with this item.
Recommended Citation:
Chang Liang,Shi Zhong-Zhi,Gu Tian-Long,et al. decidable temporal dynamic description logic[J]. Ruan Jian Xue Bao/Journal of Software,2011-01-01,22(7):1524-1537.
