On the Equivalence between Logic Programming Semantics and Argumentation Semantics

Martin Caminada, Samy Sá, João Alcântara

Research output: Chapter in Book/Report/Conference proceedingPublished conference contribution

9 Citations (Scopus)


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.
Original languageEnglish
Title of host publicationSymbolic and Quantitative Approaches to Reasoning with Uncertainty
Subtitle of host publication12th European Conference, ECSQARU 2013
EditorsLinda van der Gaag
Number of pages12
ISBN (Print)978-3-642-39090-6
Publication statusPublished - 2013

Publication series

NameLecture Notes in Artificial Intelligence


Dive into the research topics of 'On the Equivalence between Logic Programming Semantics and Argumentation Semantics'. Together they form a unique fingerprint.

Cite this