具有攻击论证集合的框架(SETAF)是著名的 Dung 抽象论证框架(AAFs)的扩展,允许对论证进行联合攻击。在本文中,我们给出了从正规逻辑程序(NLPs)到 SETAF 的转换,以及反向的、从 SETAF 到 NLPs 的转换。我们证明了它们的语义之间存在两两等价,包括 L-stable 语义与 semi-stable 语义之间的等价。此外,对于一类被称为无冗余原子逻辑程序(RFALPs)的 NLPs,还存在结构等价,因为这些往返转换互为逆变换。随后,我们通过文献中已知的一系列程序变换,将任意 NLP 转换为等价的 RFALP,从而证明 RFALPs 与 NLPs 具有同等表达能力。我们还证明这些程序变换是合流的,这意味着每个 NLP 都将被转换为唯一的 RFALP。本文给出的结果增进了我们的理解:NLPs 与 SETAF 本质上是同一种形式体系。本文正在 Theory and Practice of Logic Programming(TPLP)审稿考虑中。
英文摘要:
A framework with sets of attacking arguments (SETAF) is an extension of the well-known Dung's Abstract Argumentation Frameworks (AAFs) that allows joint attacks on arguments. In this paper, we provide a translation from Normal Logic Programs (NLPs) to SETAFs and vice versa, from SETAFs to NLPs. We show that there is pairwise equivalence between their semantics, including the equivalence between L-stable and semi-stable semantics. Furthermore, for a class of NLPs called Redundancy-Free Atomic Logic Programs (RFALPs), there is also a structural equivalence as these back-and-forth translations are each other's inverse. Then, we show that RFALPs are as expressive as NLPs by transforming any NLP into an equivalent RFALP through a series of program transformations already known in the literature. We also show that these program transformations are confluent, meaning that every NLP will be transformed into a unique RFALP. The results presented in this paper enhance our understanding that NLPs and SETAFs are essentially the same formalism. Under consideration in Theory and Practice of Logic Programming (TPLP).
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)