On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs. Issue 5 (September 2019)

• Record Type: Journal Article
• Authors: ALCÂNTARA, JOÃO; SÁ, SAMY; ACOSTA-GUADARRAMA, JUAN
• Is Part Of: Theory and practice of logic programming. Volume 19:Issue 5/6(2019)
• Page Start: 941
• Page End: 956
• Publication Date: 2019-09
• Subjects: Abstract Dialectical Frameworks, -- Normal Logic Programs, -- Argumentation, -- Instantiations of Argumentation Frameworks; Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S1471068419000280
• Languages: English
• ISSNs: 1471-0684

Abstract

Abstract: Abstract Dialectical Frameworks ( ADF s) are argumentation frameworks where each node is associated with an acceptance condition. This allows us to model different types of dependencies as supports and attacks. Previous studies provided a translation from Normal Logic Programs ( NLP s) to ADF s and proved the stable models semantics for a normal logic program has an equivalent semantics to that of the corresponding ADF . However, these studies failed in identifying a semantics for ADF s equivalent to a three-valued semantics (as partial stable models and well-founded models) for NLP s. In this work, we focus on a fragment of ADF s, called Attacking Dialectical Frameworks ( ADF + s), and provide a translation from NLP s to ADF + s robust enough to guarantee the equivalence between partial stable models, well-founded models, regular models, stable models semantics for NLP s and respectively complete models, grounded models, preferred models, stable models for ADF s. In addition, we define a new semantics for ADF + s, called L -stable, and show it is equivalent to the L -stable semantics for NLP s.