On the Equivalence between Logic Programming Semantics and Argumentation Semantics

Martinus Wigbertus Antonius Caminada, Samy Sá, João Alcântara

Research output: Working paper

9 Citations (Scopus)
6 Downloads (Pure)


In the current paper, we re-examine the connection between formal argumentation and logic programming from the perspective of semantics. We observe that one particular translation from logic programs to instantiated argumentation (the one described by Wu, Caminada and Gabbay) is able to 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
Place of PublicationAberdeen
PublisherUniversity of Aberdeen
Number of pages34
Publication statusPublished - 18 Mar 2013


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

Cite this