Abstract argumentation and answer set programming: two faces of Nelson's logic
Not on the map. Why?
Abstract (arXiv)
In this work, we show that both logic programming and abstract argumentation frameworks can be interpreted in terms of Nelson's constructive logic N4. We do so by formalizing, in this logic, two principles that we call non-contradictory inference and strengthened closed world assumption: the first states that no belief can be held based on contradictory evidence while the latter forces both unknown and contradictory evidence to be regarded as false. Using these principles, both logic programming and abstract argumentation frameworks are translated into constructive logic in a modular way and using the object language. Logic programming implication and abstract argumentation supports become, in the translation, a new implication connective following the non-contradictory inference principle. Attacks are then represented by combining this new implication with strong negation. Under consideration in Theory and Practice of Logic Programming (TPLP).
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 77 references that are in the map. First posted on arXiv 27 Mar 2022.
Builds on
4 of 77 references.
References · 4
- 2018AFRA: Argumentation framework with recursive attackscited by 6
- 2015The Attack as Intuitionistic Negationcited by 2
- 2015The Attack as Strong Negation, Part Icited by 1
- 2019Paracoherent Answer Set Semantics meets Argumentation Frameworkscited by 1
Built on by
Not cited yet.