Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

AFRA: Argumentation framework with recursive attacks

Baroni, Pietro, Cerutti, Federico, Giacomin, Massimiliano and Guida, Giovanni 2011. AFRA: Argumentation framework with recursive attacks. International Journal of Approximate Reasoning 52 (1) , pp. 19-37. 10.1016/j.ijar.2010.05.004

[img]
Preview
PDF - Accepted Post-Print Version
Download (352kB) | Preview

Abstract

The issue of representing attacks to attacks in argumentation is receiving an increasing attention as a useful conceptual modelling tool in several contexts. In this paper we present AFRA, a formalism encompassing unlimited recursive attacks within argumentation frameworks. AFRA satisfies the basic requirements of definition simplicity and rigorous compatibility with Dung’s theory of argumentation. This paper provides a complete development of the AFRA formalism complemented by illustrative examples and a detailed comparison with other recursive attack formalizations.

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 First Compliant Deposit: 8 November 2018
Date of Acceptance: 18 May 2010
Last Modified: 08 Nov 2018 15:15
URI: http://orca.cf.ac.uk/id/eprint/115751

Citation Data

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

Actions (repository staff only)

Edit Item Edit Item

Downloads

Downloads per month over past year

View more statistics