A New Labelling Algorithm for Generating Preferred Extensions of Abstract Argumentation Frameworks

Samer Nofal, Katie Atkinson, Paul Dunne, Ismail Hababeh

Abstract

The field of computational models of argument aims to provide support for automated reasoning through algorithms that operate on arguments and attack relations between them. In this paper we present a new labelling algorithm that lists all preferred extensions of an abstract argumentation framework. The new algorithm is enhanced by a new pruning strategy. We verified our new labelling algorithm and showed that it enumerates preferred extensions faster than the old labelling algorithm.

Download


Paper Citation


in Harvard Style

Nofal S., Atkinson K., Dunne P. and Hababeh I. (2019). A New Labelling Algorithm for Generating Preferred Extensions of Abstract Argumentation Frameworks.In Proceedings of the 21st International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 978-989-758-372-8, pages 340-348. DOI: 10.5220/0007737503400348


in Bibtex Style

@conference{iceis19,
author={Samer Nofal and Katie Atkinson and Paul Dunne and Ismail Hababeh},
title={A New Labelling Algorithm for Generating Preferred Extensions of Abstract Argumentation Frameworks},
booktitle={Proceedings of the 21st International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2019},
pages={340-348},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007737503400348},
isbn={978-989-758-372-8},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 21st International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - A New Labelling Algorithm for Generating Preferred Extensions of Abstract Argumentation Frameworks
SN - 978-989-758-372-8
AU - Nofal S.
AU - Atkinson K.
AU - Dunne P.
AU - Hababeh I.
PY - 2019
SP - 340
EP - 348
DO - 10.5220/0007737503400348