On the equivalence between logic programming semantics and argumentation semantics

Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238, Sa, Samy, Alcantara, Joao and Dvorak, Wolfgang 2015. On the equivalence between logic programming semantics and argumentation semantics. International Journal of Approximate Reasoning 58 , pp. 87-111. 10.1016/j.ijar.2014.12.004

Full text not available from this repository.

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.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher:	Elsevier
ISSN:	0888-613X
Date of Acceptance:	22 December 2014
Last Modified:	31 Oct 2022 10:17
URI:	https://orca.cardiff.ac.uk/id/eprint/84282

Citation Data

Cited 59 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item