On the Equivalence between Logic Programming Semantics and Argumentation Semantics

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

Research output: Working paper

8 Citations (Scopus)
4 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 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
VolumeABDN–CS–13–01
Publication statusPublished - 18 Mar 2013

Fingerprint

Equivalence
Logic Programming
Argumentation
Regular
Logic

Cite this

Caminada, M. W. A., Sá, S., & Alcântara, J. (2013). On the Equivalence between Logic Programming Semantics and Argumentation Semantics. Aberdeen: University of Aberdeen.

On the Equivalence between Logic Programming Semantics and Argumentation Semantics. / Caminada, Martinus Wigbertus Antonius; Sá, Samy; Alcântara, João.

Aberdeen : University of Aberdeen, 2013.

Research output: Working paper

Caminada, MWA, Sá, S & Alcântara, J 2013 'On the Equivalence between Logic Programming Semantics and Argumentation Semantics' University of Aberdeen, Aberdeen.
Caminada MWA, Sá S, Alcântara J. On the Equivalence between Logic Programming Semantics and Argumentation Semantics. Aberdeen: University of Aberdeen. 2013 Mar 18.
Caminada, Martinus Wigbertus Antonius ; Sá, Samy ; Alcântara, João. / On the Equivalence between Logic Programming Semantics and Argumentation Semantics. Aberdeen : University of Aberdeen, 2013.
@techreport{c9e9550fcb1e4b4bb7fda7d02255aba6,
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 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.",
author = "Caminada, {Martinus Wigbertus Antonius} and Samy S{\'a} and Jo{\~a}o Alc{\^a}ntara",
year = "2013",
month = "3",
day = "18",
language = "English",
volume = "ABDN–CS–13–01",
publisher = "University of Aberdeen",
type = "WorkingPaper",
institution = "University of Aberdeen",

}

TY - UNPB

T1 - On the Equivalence between Logic Programming Semantics and Argumentation Semantics

AU - Caminada, Martinus Wigbertus Antonius

AU - Sá, Samy

AU - Alcântara, João

PY - 2013/3/18

Y1 - 2013/3/18

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

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

M3 - Working paper

VL - ABDN–CS–13–01

BT - On the Equivalence between Logic Programming Semantics and Argumentation Semantics

PB - University of Aberdeen

CY - Aberdeen

ER -