On the equivalence between logic programming semantics and argumentation semantics

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.

Grafik Top
Authors
  • Caminada, Martin
  • Sá, Samy
  • Alcântara , João
  • Dvořák, Wolfgang
Grafik Top
Shortfacts
Category
Journal Paper
Divisions
Theory and Applications of Algorithms
Subjects
Kuenstliche Intelligenz
Theoretische Informatik
Journal or Publication Title
International Journal of Approximate Reasoning
ISSN
0888-613X
Page Range
pp. 87-111
Volume
58
Date
December 2014
Official URL
http://www.sciencedirect.com/science/article/pii/S...
Export
Grafik Top