arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2407.05538cs.AI
收藏

逻辑程序设计与 SETAF 之间的等价性

On the Equivalence between Logic Programming and SETAF

Federal University of Ceará(塞阿拉联邦大学)

João Alcântara, Renan Cordeiro, Samy Sá

AI总结:

本文建立 NLPs 与 SETAF 之间的双向语义等价,并证明任意 NLP 可经合流变换唯一化为等价 RFALP,表明二者本质上是同一形式体系。

摘要:

具有攻击论证集合的框架(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).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑