A Family of Dynamic Description Logics for Representing and Reasoning About Actions
A Family of Dynamic Description Logics for Representing and Reasoning About Actions
复制标题
用于表示和推理动作的一系列动态描述逻辑
DOI:
10.1007/s10817-010-9210-1
复制
发表时间:
2012-06
期刊:
影响因子:
--
通讯作者:
Lingzhong Zhao
中科院分区:
文献类型:
--
作者:
Liang Chang;Zhongzhi Shi;Tianlong Gu;Lingzhong Zhao
Description logics provide powerful languages for representing and reasoning about knowledge of static application domains. The main strength of description logics is that they offer considerable expressive power going far beyond propositional logic, while reasoning is still decidable. There is a demand to bring the power and character of description logics into the description and reasoning of dynamic application domains which are characterized by actions. In this paper, based on a combination of the propositional dynamic logic PDL, a family of description logics and an action formalism constructed over description logics, we propose a family of dynamic description logicsDDL(X@) for representing and reasoning about actions, whereXrepresents well-studied description logics ranging from the to the , andX@denotes the extension ofXwith the @ constructor. The representation power ofDDL(X@) is reflected in four aspects. Firstly, the static knowledge of application domains is represented as RBoxes and acyclic TBoxes of the description logicX. Secondly, the states of the world and the pre-conditions of atomic actions are described by ABox assertions of the description logicX@, and the post-conditions of atomic actions are described by primitive literals ofX@. Thirdly, starting with atomic actions and ABox assertions ofX@, complex actions are constructed with regular program constructors of PDL, so that various control structures on actions such as the “Sequence”, “Choice”, “Any-Order”, “Iterate”, “If-Then-Else”, “Repeat-While” and “Repeat-Until” can be represented. Finally, both atomic actions and complex actions are used as modal operators for the construction of formulas, so that many properties on actions can be explicitly stated by formulas. A tableau-algorithm is provided for deciding the satisfiability ofDDL(X@)-formulas; based on this algorithm, reasoning tasks such as the realizability, executability and projection of actions can be effectively carried out. As a result,DDL(X@) not only offers considerable expressive power going beyond many action formalisms which are propositional, but also provides decidable reasoning services for actions described by it.
登录
查看更多内容
DOI:
10.1007/3-540-61511-3_117
发表时间:
1996-08
期刊:
--
影响因子:
--
作者:
Giuseppe De Giacomo;F. Massacci
通讯作者:
Giuseppe De Giacomo;F. Massacci
DOI:
--
发表时间:
2007
期刊:
Description Logics
影响因子:
--
作者:
L. Chang;Zhongzhi Shi;L. Qiu;Fen Lin
通讯作者:
L. Chang;Zhongzhi Shi;L. Qiu;Fen Lin
DOI:
--
发表时间:
2009-10
期刊:
--
影响因子:
--
作者:
Hongkai Liu
通讯作者:
Hongkai Liu
DOI:
10.1007/s10817-007-9079-9
发表时间:
2007-10
期刊:
Journal of Automated Reasoning
影响因子:
--
作者:
Ian Horrocks;U. Sattler
通讯作者:
Ian Horrocks;U. Sattler
DOI:
--
发表时间:
1998
期刊:
--
影响因子:
--
作者:
F. Wolter;M. Zakharyaschev
通讯作者:
F. Wolter;M. Zakharyaschev