On the Equivalence between Logic Programming and SETAF

被引:0
作者
Alcantara, Joao [1 ]
Cordeiro, Renan [1 ]
Sa, Samy [1 ]
机构
[1] Univ Fed Ceara, Fortaleza, Brazil
关键词
argumentation; logic programming semantics; program transformations; ASSUMPTION-BASED ARGUMENTATION; SEMANTICS; FRAMEWORKS;
D O I
10.1017/S1471068424000188
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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 NLP s. 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.
引用
收藏
页码:1208 / 1236
页数:29
相关论文
共 45 条
[1]   On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs [J].
Alcantara, Joao ;
Sa, Samy ;
Acosta-Guadarrama, Juan .
THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2019, 19 (5-6) :941-956
[2]  
Alcantara Joao, 2021, 19 INT WORKSHOP NONM, P139
[3]   ON THE CORRECTNESS OF UNFOLD/FOLD TRANSFORMATION OF NORMAL AND EXTENDED LOGIC PROGRAMS [J].
ARAVINDAN, C ;
DUNG, PM .
JOURNAL OF LOGIC PROGRAMMING, 1995, 24 (03) :201-217
[4]  
Beirlaen M, 2018, J APPL LOG-IFCOLOG, V5, P629
[5]   An abstract, argumentation-theoretic approach to default reasoning [J].
Bondarenko, A ;
Dung, PM ;
Kowalski, RA ;
Toni, F .
ARTIFICIAL INTELLIGENCE, 1997, 93 (1-2) :63-101
[6]   Characterizations of the disjunctive well-founded semantics: Confluent calculi and iterated GCWA [J].
Brass, S ;
Dix, J .
JOURNAL OF AUTOMATED REASONING, 1998, 20 (1-2) :143-165
[7]   Characterizations of the disjunctive stable semantics by partial evaluation [J].
Brass, S ;
Dix, J .
JOURNAL OF LOGIC PROGRAMMING, 1997, 32 (03) :207-228
[8]   Semantics of (disjunctive) logic programs based on partial evaluation [J].
Brass, S ;
Dix, J .
JOURNAL OF LOGIC PROGRAMMING, 1999, 40 (01) :1-46
[9]  
Brass S., 1994, Innovationen Bei Rechen-und Kommunikationssystemen, P83
[10]  
Brass S., 1995, ICLP, P199