Boosting the Correspondence between Description Logics and Propositional Dynamic Logics
Boosting the Correspondence between Description Logics and Propositional Dynamic Logics
复制标题
增强描述逻辑和命题动态逻辑之间的对应关系
DOI：
--
复制
发表时间：
1994
期刊：
影响因子：
--
通讯作者：
M. Lenzerini
中科院分区：
文献类型：
--
作者：
Giuseppe De Giacomo;M. Lenzerini
术语推理领域的主要主题之一是识别既具有很强的表现力又可判定的描述逻辑(DLS)。斯柴尔德最近的一篇论文表明，通过依赖DLS和命题动态逻辑(PDL)之间的对应关系，可以有效地解决这个问题。然而，斯柴尔德留下了三个重要的问题，涉及到角色的功能限制(直接和反向)、数量限制和对个人的断言的PDL转换。本文所报道的工作为这些问题提供了解决方案。这一结果具有双重意义。从DLS的观点出发，我们得到了文献中出现的一些最具表现力的逻辑的可判断性和复杂性结果，并且从PDLS的观点出发，我们得到了表示几种形式的程序决定论和部分计算规范的一般方法论。
One of the main themes in the area of Terminological Reasoning has been to identify description logics (DLs) that are both very expressive and decidable. A recent paper by Schild showed that this issue can be profitably addressed by relying on a correspondence between DLs and propositional dynamic logics (PDL). However Schild left open three important problems, related to the translation into PDLs of functional restrictions on roles (both direct and inverse), number restrictions, and assertions on individuals. The work reported in this paper presents a solution to these problems. The results have a twofold significance. From the standpoint of DLs, we derive decidability and complexity results for some of the most expressive logics appeared in the literature, and from the standpoint of PDLs, we derive a general methodology for the representation of several forms of program determinism and for the specification of partial computations.