回答集编程(Answer Set Programming,ASP)是一种重要的基于规则的知识表示与推理语言,起源于逻辑编程和非单调推理。为捕捉ASP程序中去除(不)相关细节的本质,学界研究了多种不同概念,从强持久(strong persistence,SP)遗忘,到忠实抽象,再到近年提出的强简化——其中后两者可分别视为遗忘概念的松弛版与强化版。尽管已有研究发现这些概念存在关联,尤其是它们都能通过强等价的语义进行刻画,但它们能否被统一起来仍不明确。在本研究中,我们通过提出一种新的相对化等价概念填补了这一空白,该概念是对近年提出的简化概念的松弛,能够涵盖文献中所有相关概念。我们给出了相对化可简化性的充要条件,表明难点在于上下文程序未包含所有待去除原子的情况。随后我们提出了一种结合投影与(SP)遗忘松弛的算子,用于得到相对化简化结果。此外我们还给出了复杂度结果,完善了整体研究图景。
英文摘要:
Answer Set Programming (ASP) is a prominent rule-based language for knowledge representation and reasoning with roots in logic programming and non-monotonic reasoning. The aim to capture the essence of removing (ir)relevant details in ASP programs led to the investigation of different notions, from strong persistence (SP) forgetting, to faithful abstractions, and, recently, strong simplifications, where the latter two can be seen as relaxed and strengthened notions of forgetting, respectively. Although it was observed that these notions are related, especially given that they have characterizations through the semantics for strong equivalence, it remained unclear whether they can be brought together. In this work, we bridge this gap by introducing a novel relativized equivalence notion, which is a relaxation of the recent simplification notion, that is able to capture all related notions from the literature. We provide necessary and sufficient conditions for relativized simplifiability, which shows that the challenging part is for when the context programs do not contain all the atoms to remove. We then introduce an operator that combines projection and a relaxation of (SP)-forgetting to obtain the relativized simplifications. We furthermore present complexity results that complete the overall picture.
A General Framework of Epistemic Forgetting and its Instantiation by Ranking Functions
Faculty of Mathematics(数学系);Computer Science, University of Hagen, 58084 Hagen, Germany(计算机科学,海因斯大学,德国);Department of Computer Science, Technology Dortmund University, 44221 Dortmund, Germany(计算机科学系,多特蒙德技术大学,德国)
A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming
Technische Universität Wien(维也纳工业大学)
如今,在答案集语义下的逻辑编程处理了许多不同的程序等价概念。这是因为替代等价(称为强等价)和普通等价是不同的概念。前者成立,给定程序P和Q,当且仅当P在任何上下文R内都可以被Q忠实地替换;后者成立当且仅当P和Q提供相同的输出,即它们具有相同的答案集。强等价和普通等价之间的概念被引入作为比较不完整程序的理论工具,并且通过限制所考虑的上下文程序R的句法结构或通过限制允许在R中出现的原子的集合A(相对化等价)来定义。然而,对于前一种方法,结果是对R的任何“合理”的句法限制都与普通的、强的或一致的等价一致。在本文中,我们提出了一个参数化的等价概念,同时照顾到这两种限制的范围内,一方面,允许发生在规则头的上下文中的原子,另一方面,允许发生在规则机构的上下文中的原子。我们介绍了一个一般的语义特征,其中包括已知的SE模型(强等价)或UE模型(一致等价)作为特殊情况。此外,我们提供的问题的复杂性界限,并勾勒出一个可能的实现方法。逻辑程序设计理论与实践(Theory and Practice of Logic Programming,TPLP)
Relativized hyperequivalence of logic programs for modular programming
University of Kentucky(肯塔基大学);Technische Universität Wien(维也纳工业大学)
最近的框架相对化hyperequivalence的程序提供了一个统一的推广强和一致的等价。它似乎特别适合于程序优化和模块化编程中的应用,因为它的灵活性允许我们在上下文程序中相互独立地限制头部和主体字母表。本文研究了逻辑程序的稳定、支持和支持最小模型的三种语义的相对化超等价性。对于每一种语义,我们确定四种类型的上下文,这取决于头部和身体字母是直接给出的还是作为给定集合的补充。超等价相对于上下文的头部和身体字母直接指定已经研究过。在本文中,我们建立了相对于其他三种类型的上下文程序决定相对化超等价的复杂性。逻辑程序设计理论与实践(Theory and Practice of Logic Programming,TPLP)