On the equivalence between logic programming semantics and argumentation semantics

Martin Caminada, Samy Sá, João Alcântara, Wolfgang Dvořák

Research output: Contribution to journalArticle

36 Citations (Scopus)
5 Downloads (Pure)

Abstract

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 show equivalence 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
Pages (from-to)87-111
Number of pages25
JournalInternational Journal of Approximate Reasoning
Volume58
Early online date29 Dec 2014
DOIs
Publication statusPublished - Mar 2015

Keywords

  • abstract argumentation semantics
  • logic programming semantics

Fingerprint Dive into the research topics of 'On the equivalence between logic programming semantics and argumentation semantics'. Together they form a unique fingerprint.

  • Cite this