In this paper, we re-examine the connection between formal argumentation and logic programming from the perspective of semantics. We note that one particular translation from logic programs to instantiated argumentation (the one described by Wu, Caminada and Gabbay) can serve as a basis for describing various equivalences between logic programming semantics and argumentation semantics. In particular, we are able to provide a formal connection between regular semantics for logic programming and preferred semantics for formal argumentation. We also show that there exist logic programming semantics (L-stable semantics) that cannot be captured by any abstract argumentation semantics.
|Title of host publication||Symbolic and Quantitative Approaches to Reasoning with Uncertainty|
|Subtitle of host publication||12th European Conference, ECSQARU 2013|
|Editors||Linda van der Gaag|
|Number of pages||12|
|Publication status||Published - 2013|
|Name||Lecture Notes in Artificial Intelligence|
Caminada, M., Sá, S., & Alcântara, J. (2013). On the Equivalence between Logic Programming Semantics and Argumentation Semantics. In L. van der Gaag (Ed.), Symbolic and Quantitative Approaches to Reasoning with Uncertainty: 12th European Conference, ECSQARU 2013 (pp. 97-108). (Lecture Notes in Artificial Intelligence; Vol. 7958). Springer-Verlag. https://doi.org/10.1007/978-3-642-39091-3_9