Looking-ahead in backtracking algorithms for abstract argumentation

Nofal, S, Atkinson, KM ORCID: 0000-0002-5683-4106 and Dunne, PE ORCID: 0000-0002-6033-3742
(2016) Looking-ahead in backtracking algorithms for abstract argumentation. International Journal of Approximate Reasoning, 78. 265 - 282.

This is the latest version of this item.

[img] Text
1-s2.0-S0888613X16301189-main.pdf - Accepted Version

Download (640kB)


We refine implemented backtracking algorithms for a number of problems related to Dung's argumentation frameworks. Under admissible, preferred, complete, stable, semi stable, and ideal semantics we add enhancements, what are so-called global looking-ahead pruning strategies, to the-state-of-the-art implementations of two problems. First, we tackle the extension enumeration problem: constructing some/all set(s) of acceptable arguments of a given argumentation framework. Second, we address the acceptance decision problem: deciding whether an argument is in some/all set(s) of accepted arguments of a given argumentation framework. The experiments that we report show that the speedup gain of the new enhancements is quite significant.

Item Type: Article
Uncontrolled Keywords: algorithms, argumentation semantics, argument-based reasoning
Depositing User: Symplectic Admin
Date Deposited: 06 Dec 2017 11:02
Last Modified: 09 Jan 2021 08:18
DOI: 10.1016/j.ijar.2016.07.013
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3011345

Available Versions of this Item