On the equivalence between logic programming semantics and argumentation semantics

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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of approximate reasoning Jg. 58; S. 87 - 111
Hauptverfasser: Caminada, Martin, Sá, Samy, Alcântara, João, Dvořák, Wolfgang
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Inc 01.03.2015
Schlagworte:
Abstract argumentation semantics
Approximation
Equivalence
Logic programming
Logic programming semantics
Reasoning
Semantics
Translations
Abstract argumentation semantics
Logic programming semantics
ISSN:0888-613X, 1873-4731
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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. •We re-examine the equivalence between logic programming (LP) and argumentation.•One particular translation yields a whole range of semantic equivalences.•Notorious exception: L-stable (LP) and semi-stable (argumentation) do not coincide.•Several argumentation semantics operate by minimizing/maximizing argument labels.•Several LP semantics operate by minimizing/maximizing conclusion labels.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0888-613X
1873-4731
DOI:10.1016/j.ijar.2014.12.004