On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs

Jo\~ao Alc\^antara; Juan Acosta-Guadarrama; Samy S\'a

On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs

T0 review · 0 major / 2 minor · reviewed 2026-05-24 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read A translation from normal logic programs to attacking dialectical frameworks equates their main semantics including partial stable and well-founded models.

desk verdict This paper gives a translation from normal logic programs to the ADF+ fragment that matches partial stable, well-founded, regular, and stable models to the corresponding ADF semantics, plus defines L-stable for both. read the letter →

arxiv 1907.09548 v1 pith:DWANL5CI submitted 2019-07-22 cs.AI cs.LO

João Alcântara , Samy Sá , Juan Acosta-Guadarrama This is my paper

classification cs.AIcs.LO

keywords abstractdialecticalframeworksnormallogicprogramssemanticsequivalencepartialstablemodelswell-foundedattackingthree-valued

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper establishes a translation from normal logic programs into the attacking fragment of abstract dialectical frameworks. This mapping is designed so that the partial stable models of a program line up exactly with the complete models of the resulting framework, the well-founded model with the grounded model, regular models with preferred models, and stable models with stable models. The work also introduces an L-stable semantics for the frameworks that matches the corresponding semantics already used for logic programs. A reader would care because it unifies two separate formalisms for nonmonotonic reasoning that previously lacked full three-valued equivalence.

What carries the argument

The translation from normal logic programs to attacking dialectical frameworks (ADF+), which sets each node's acceptance condition to encode the exact positive and negative dependencies in the program's rules.

What would settle it

A normal logic program together with its translated ADF+ in which some partial stable model of the program fails to correspond to any complete model of the framework would refute the claimed equivalences.

Watch

Extended reading notes

Core claim

We provide a translation from NLPs to ADF+s robust enough to guarantee the equivalence between partial stable models, well-founded models, regular models, stable models semantics for NLPs and respectively complete models, grounded models, preferred models, stable models for ADFs. In addition, we define a new semantics for ADF+s, called L-stable, and show it is equivalent to the L-stable semantics for NLPs.

Load-bearing premise

The acceptance conditions of the ADF+ can be defined to capture the logical dependencies in NLP rules exactly so that three-valued interpretations align without distortion or loss.

Editorial extensions

If this is right

Partial stable models of an NLP correspond one-to-one with complete models of its ADF+ translation.
The well-founded model of an NLP corresponds to the grounded model of the ADF+.
Regular models of an NLP correspond to preferred models of the ADF+.
Stable models remain equivalent between the two formalisms under the translation.
The newly defined L-stable semantics for ADF+s matches the L-stable semantics for NLPs.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

Systems that already compute one formalism's models could now be reused for the other without loss of the main three-valued semantics.
The translation might be adapted to handle other nonmonotonic formalisms that rely on similar attack and support patterns.
Unified implementations could simplify hybrid reasoning tools that mix logic rules with explicit dialectical acceptance conditions.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Desk Editor's Note

read the letter

The core contribution is a translation from NLPs into ADF+ that preserves the listed equivalences for three-valued and two-valued semantics, along with the new L-stable semantics that lines up on both sides. Earlier translations only handled stable models, so this fills the specific gap noted in the abstract by restricting the target to the attacking fragment and adding the L-stable case. The work is narrow and technical, which is appropriate for the claim. It builds directly on standard semantics definitions and prior stable-model results without obvious circularity or extra assumptions beyond the fragment choice. The restriction to ADF+ is explicit and necessary for the three-valued alignments to hold, so it does not overclaim generality. No load-bearing inconsistencies show up in the stated results or stress-test. This is useful for researchers who already work at the overlap of logic programming and abstract argumentation. It organizes the semantics cleanly and could support tool transfer within that subfield. A reader outside non-monotonic reasoning or knowledge representation would not get much from it. I would bring this to a reading group focused on argumentation or LP semantics. I would not cite it in my own work. It deserves peer review because the claims are precise, the gap is real, and the approach is grounded enough to warrant referee time.

Referee Report

0 major / 2 minor

Summary. The manuscript presents a translation from Normal Logic Programs (NLPs) to the Attacking Dialectical Frameworks (ADF+) fragment of Abstract Dialectical Frameworks. It establishes that this translation preserves equivalences between partial stable models of NLPs and complete models of ADF+s, well-founded models and grounded models, regular models and preferred models, and stable models for both formalisms. It additionally introduces an L-stable semantics for ADF+s shown to be equivalent to the L-stable semantics for NLPs.

Significance. If the translation and proofs hold, the work supplies the missing three-valued correspondences that prior NLP-to-ADF translations did not achieve. The explicit construction together with the new L-stable semantics constitutes a concrete bridge between logic programming and abstract argumentation, enabling potential transfer of computational techniques and results across the two areas.

minor comments (2)

Notation for ADF+ is introduced as ADF$^+$ in the abstract and title but should be checked for uniform use (with or without the + superscript) in all definitions and theorems throughout the manuscript.
A small comparison table listing the four (plus L-stable) semantics pairs and the corresponding model notions would improve readability of the central claim.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of our manuscript and the recommendation for minor revision. No specific major comments were provided in the report, so there are no individual points requiring point-by-point rebuttal or revision at this stage.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity in claimed equivalences

full rationale

The paper supplies an explicit translation from NLPs to the ADF+ fragment together with proofs that the listed three-valued and two-valued semantics are preserved. Prior work is cited only for the already-established stable-model case; the new results for partial stable, well-founded, regular, and L-stable semantics rest on the translation definition and standard model-theoretic arguments rather than on any self-referential reduction, fitted parameter renamed as prediction, or load-bearing self-citation chain. The derivation chain is therefore self-contained against external semantic definitions.

Assumptions & free parameters 0 free parameters · 1 assumptions · 0 invented entities

Abstract-only review; no free parameters, invented entities, or ad hoc axioms identified beyond standard domain assumptions from logic programming and argumentation.

assumptions (1)

domain assumption Standard definitions of stable models, partial stable models, well-founded models, complete models, grounded models, preferred models, and L-stable models from the logic programming and argumentation literature
The claimed equivalences are defined with respect to these pre-existing semantics as referenced in the abstract.

how reviews work

0 comments

Cite this review

Pith. "Pith review of On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs." pith.science (2026). https://pith.science/paper/DWANL5CI

@misc{pith2026190709548,
  author       = {Pith},
  title        = {Pith review of: On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DWANL5CI}},
  note         = {Machine review of arXiv:1907.09548}
}

abstract

Abstract Dialectical Frameworks (ADFs) 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 (NLPs) to ADFs 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 ADFs equivalent to a three-valued semantics (as partial stable models and well-founded models) for NLPs. In this work, we focus on a fragment of ADFs, called Attacking Dialectical Frameworks (ADF$^+$s), and provide a translation from NLPs to ADF$^+$s robust enough to guarantee the equivalence between partial stable models, well-founded models, regular models, stable models semantics for NLPs and respectively complete models, grounded models, preferred models, stable models for ADFs. In addition, we define a new semantics for ADF$^+$s, called L-stable, and show it is equivalent to the L-stable semantics for NLPs. This paper is under consideration for acceptance in TPLP.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

22 extracted references · 22 canonical work pages

[1]

, Dung, P

Bondarenko, A. , Dung, P. M. , Kow alski, R. A. , and Toni, F. 1997. An abstract, argumentation-theoretic approach to default reasoning. Art. Intelligence 93, 1-2, 63–101. 16 J. Alcˆ antara and S. S´ a and J. Acosta-Guadarrama

work page 1997
[2]

and Dix, J

Brass, S. and Dix, J. 1995. Characterizations of the stable semantics by partial evaluation. In International Conf. on Logic Programming and Nonmonotonic Reasoning. Springer, 85–98

work page 1995
[3]

, Ellmauthaler, S

Brewka, G. , Ellmauthaler, S. , Strass, H. , W allner, J. P. , and Woltran, S. 2013. Abstract dialectical frameworks revisited. In Proceedings of the Twenty-Third international joint conference on Artiﬁcial Intelligence . AAAI Press, 803–809

work page 2013
[4]

and Woltran, S

Brewka, G. and Woltran, S. 2010. Abstract dialectical frameworks. In Twelfth International Conf. on the Principles of Knowledge Representation and Rea soning. AAAI Press, 102–111

work page 2010
[5]

Buss, S. R. 1987. The boolean formula value problem is in alogtime. In Proceedings of the nineteenth annual ACM symposium on Theory of computing . ACM, 123–131

work page 1987
[6]

Caminada, M. 2006. Semi-stable semantics. 1st International Conference on Computational Models of Argument (COMMA) 144 , 121–130

work page 2006
[7]

and Schulz, C

Caminada, M. and Schulz, C. 2017. On the equivalence between assumption-based argumen - tation and logic programming. Journal of Artiﬁcial Intelligence Research 60 , 779–825

work page 2017
[8]

Dung, P. 1995. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artiﬁcial Intelligence 77 , 321–357

work page 1995

Show all 22 references

[9]

Dung, P. M. , Kow alski, R. A. , and Toni, F. 2009. Assumption-based argumentation. In Argumentation in artiﬁcial intelligence . Springer, 199–218

2009
[10]

, Leone, N

Eiter, T. , Leone, N. , and Sacc ´a, D. 1997. On the partial semantics for disjunctive deductive databases. Ann. Math. Artif. Intell. 19, 1-2, 59–96

1997
[11]

Ellmauthaler, S. 2012. Abstract Dialectical Frameworks: Properties, Compl exity, and Im- plementation. M.S. thesis, Technische Universit¨ at Wien, Institut f¨ ur Informationssysteme

2012
[12]

and Lifschitz, V

Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Proc. of the 5th International Conference on Logic Programm ing (ICLP) . Vol. 88. 1070–1080

1988
[13]

Kleene, S. C. , de Bruijn, N. , de Groot, J. , and Zaanen, A. C. 1952. Introduction to metamathematics. Vol. 483. van Nostrand New York

1952
[14]

Nielsen, S. H. and P arsons, S. 2006. A generalization of Dung’s abstract framework for argumentation: Arguing with sets of attacking arguments. I n International Workshop on Argumentation in Multi-Agent Systems . Springer, 54–73

2006
[15]

Polberg, S. 2016. Understanding the abstract dialectical framework. I n European Conference on Logics in Artiﬁcial Intelligence . Springer, 430–446

2016
[16]

and Sartor, G

Prakken, H. and Sartor, G. 1997. Argument-based extended logic programming with de- feasible priorities. Journal of applied non-classical logics 7, 1-2, 25–75

1997
[17]

Przymusinski, T. C. 1990. The well-founded semantics coincides with the three- valued stable semantics. Fundamenta Informaticae 13, 4, 445–463

1990
[18]

and Toni, F

Schulz, C. and Toni, F. 2015. Logic programming in assumption-based argumentatio n revisited-semantics and graphical representation. In 29th AAAI Conf. on Art. Intelligence

2015
[19]

Simari, G. R. and Loui, R. P. 1992. A mathematical treatment of defeasible reasoning and its implementation. Artiﬁcial intelligence 53, 2-3, 125–157

1992
[20]

Strass, H. 2013. Approximating operators and semantics for abstract d ialectical frameworks. Artiﬁcial Intelligence 205 , 39–70

2013
[21]

Toni, F. 2014. A tutorial on assumption-based argumentation. Argument & Computation 5, 1, 89–117

2014
[22]

, Caminada, M

Wu, Y. , Caminada, M. , and Gabbay, D. M. 2009. Complete extensions in argumentation coincide with 3-valued stable models in logic programming. Studia logica 93, 2-3, 383. On the Equivalence Between ADF s and Logic Programs 17 Appendix A Proofs of Theorems A.1 Theorems and Pro...

2009

Pith tools

Reviewed May 24, 2026 · model on record in the stance chip above.

[1] [1]

, Dung, P

Bondarenko, A. , Dung, P. M. , Kow alski, R. A. , and Toni, F. 1997. An abstract, argumentation-theoretic approach to default reasoning. Art. Intelligence 93, 1-2, 63–101. 16 J. Alcˆ antara and S. S´ a and J. Acosta-Guadarrama

work page 1997

[2] [2]

and Dix, J

Brass, S. and Dix, J. 1995. Characterizations of the stable semantics by partial evaluation. In International Conf. on Logic Programming and Nonmonotonic Reasoning. Springer, 85–98

work page 1995

[3] [3]

, Ellmauthaler, S

Brewka, G. , Ellmauthaler, S. , Strass, H. , W allner, J. P. , and Woltran, S. 2013. Abstract dialectical frameworks revisited. In Proceedings of the Twenty-Third international joint conference on Artiﬁcial Intelligence . AAAI Press, 803–809

work page 2013

[4] [4]

and Woltran, S

Brewka, G. and Woltran, S. 2010. Abstract dialectical frameworks. In Twelfth International Conf. on the Principles of Knowledge Representation and Rea soning. AAAI Press, 102–111

work page 2010

[5] [5]

Buss, S. R. 1987. The boolean formula value problem is in alogtime. In Proceedings of the nineteenth annual ACM symposium on Theory of computing . ACM, 123–131

work page 1987

[6] [6]

Caminada, M. 2006. Semi-stable semantics. 1st International Conference on Computational Models of Argument (COMMA) 144 , 121–130

work page 2006

[7] [7]

and Schulz, C

Caminada, M. and Schulz, C. 2017. On the equivalence between assumption-based argumen - tation and logic programming. Journal of Artiﬁcial Intelligence Research 60 , 779–825

work page 2017

[8] [8]

Dung, P. 1995. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artiﬁcial Intelligence 77 , 321–357

work page 1995