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
期刊:
Journal of Automated Reasoning
影响因子:
--
通讯作者:
Lingzhong Zhao
Lingzhong Zhao
中科院分区:
其他
文献类型:
--
作者:
Liang Chang;Zhongzhi Shi;Tianlong Gu;Lingzhong Zhao

文献摘要

参考文献

被引文献

相似文献

描述逻辑为表示和推理静态应用领域的知识提供了强大的语言。描述逻辑的主要优势在于,它们提供了相当大的表达能力,远远超出了命题逻辑,而推理仍然是可决定的。需要将描述逻辑的能力和特性引入到以动作为特征的动态应用领域的描述和推理中。在本文中,基于命题动态逻辑PDL、描述逻辑和在描述逻辑上构造的动作形式的组合,我们提出了一个用于表示和推理动作的动态描述逻辑ddl (X@)族,其中的x代表了已经研究得很好的描述逻辑,范围从0到0,andX@denotes是x的扩展和@构造函数。ddl (X@)的表示力体现在四个方面。首先,将应用领域的静态知识表示为描述logicX的rbox和无循环tbox;其次,用描述logicX@的ABox断言描述世界状态和原子动作的前提条件,用原始文字ofX@.描述原子动作的后条件第三,从x @的原子动作和ABox断言开始,用PDL的常规程序构造函数构造复杂动作,从而表示出“Sequence”、“Choice”、“Any-Order”、“Iterate”、“If-Then-Else”、“Repeat-While”和“Repeat-Until”等动作的各种控制结构。最后,原子动作和复杂动作都被用作构造公式的模态操作符,这样就可以用公式显式地声明动作的许多属性。给出了一种确定ddl (X@)-公式可满足性的表算法;基于该算法,可以有效地完成动作的可实现性、可执行性和投射性等推理任务。因此,DDL(X@)不仅提供了超越许多命题式动作形式的强大表达能力,而且还为其描述的动作提供了可决定的推理服务。
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