On the equivalence between logic programming semantics and argumentation semantics

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

doi:10.1016/j.ijar.2014.12.004

On the equivalence between logic programming semantics and argumentation semantics

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

Computing Science

Research output: Contribution to journal › Article › peer-review

64 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 language	English
Pages (from-to)	87-111
Number of pages	25
Journal	International Journal of Approximate Reasoning
Volume	58
Early online date	29 Dec 2014
DOIs	https://doi.org/10.1016/j.ijar.2014.12.004
Publication status	Published - Mar 2015

Keywords

abstract argumentation semantics
logic programming semantics

Access to Document

10.1016/j.ijar.2014.12.004Licence: Unspecified

IJAR_ArgLPSubmitted manuscript, 551 KB

Cite this

@article{ea37975e74e44f49a52d54c832f23d45,

title = "On the equivalence between logic programming semantics and argumentation semantics",

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.",

keywords = "abstract argumentation semantics, logic programming semantics",

author = "Martin Caminada and Samy S{\'a} and Jo{\~a}o Alc{\^a}ntara and Wolfgang Dvo{\v r}{\'a}k",

note = "This work has been supported by the National Research Fund, Luxembourg (LAAMI project), by the Engineering and Physical Sciences Research Council (EPSRC, UK), grant Ref. EP/J012084/1 (SAsSy project), by CNPq (Universal 2012 – Proc. 473110/2012-1), and by CNPq/CAPES (Casadinho/PROCAD 2011).",

year = "2015",

month = mar,

doi = "10.1016/j.ijar.2014.12.004",

language = "English",

volume = "58",

pages = "87--111",

journal = "International Journal of Approximate Reasoning",

issn = "0888-613X",

publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - On the equivalence between logic programming semantics and argumentation semantics

AU - Caminada, Martin

AU - Sá, Samy

AU - Alcântara, João

AU - Dvořák, Wolfgang

N1 - This work has been supported by the National Research Fund, Luxembourg (LAAMI project), by the Engineering and Physical Sciences Research Council (EPSRC, UK), grant Ref. EP/J012084/1 (SAsSy project), by CNPq (Universal 2012 – Proc. 473110/2012-1), and by CNPq/CAPES (Casadinho/PROCAD 2011).

PY - 2015/3

Y1 - 2015/3

N2 - 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.

AB - 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.

KW - abstract argumentation semantics

KW - logic programming semantics

U2 - 10.1016/j.ijar.2014.12.004

DO - 10.1016/j.ijar.2014.12.004

M3 - Article

VL - 58

SP - 87

EP - 111

JO - International Journal of Approximate Reasoning

JF - International Journal of Approximate Reasoning

SN - 0888-613X

ER -

On the equivalence between logic programming semantics and argumentation semantics

Abstract

Keywords

Access to Document

Fingerprint

Cite this