使用描述逻辑管理图结构数据的变化(带附录的长版本)
Managing Change in Graph-structured Data Using Description Logics (long version with appendix)
摘要:
在本文中,我们考虑的图形结构的数据,演变的结果,由用户或应用程序进行的操作的设置。我们研究了不同的推理问题,其范围从确保在给定的更新序列之后满足给定的完整性约束集合,到决定将数据带到(不)理想状态的动作序列的(不)存在,从一个特定的数据实例或从它的不完整的描述开始。我们考虑一个动作语言,其中动作是条件的有限序列节点和标签的插入和删除,并使用描述逻辑来描述数据的完整性约束和(部分)状态。然后,我们将上述数据管理问题形式化为一个静态验证问题和几个规划问题。我们提供算法和严格的复杂性界限的形式化问题,无论是表达DL和DL-Lite的变体。
英文摘要:
In this paper, we consider the setting of graph-structured data that evolves as a result of operations carried out by users or applications. We study different reasoning problems, which range from ensuring the satisfaction of a given set of integrity constraints after a given sequence of updates, to deciding the (non-)existence of a sequence of actions that would take the data to an (un)desirable state, starting either from a specific data instance or from an incomplete description of it. We consider an action language in which actions are finite sequences of conditional insertions and deletions of nodes and labels, and use Description Logics for describing integrity constraints and (partial) states of the data. We then formalize the above data management problems as a static verification problem and several planning problems. We provide algorithms and tight complexity bounds for the formalized problems, both for an expressive DL and for a variant of DL-Lite.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。