On Deciding Admissibility in Abstract Argumentation Frameworks

Samer Nofal, Katie Atkinson, Paul E. Dunne

2019

Abstract

In the context of abstract argumentation frameworks, the admissibility problem is about deciding whether a given argument (i.e. piece of knowledge) is admissible in a conflicting knowledge base. In this paper we present an enhanced backtracking-based algorithm for solving the admissibility problem. The algorithm performs successfully when applied to a wide range of benchmark abstract argumentation frameworks and when compared to the state-of-the-art algorithm.

Paper Citation

in Harvard Style

Nofal S., Atkinson K. and Dunne P. (2019). On Deciding Admissibility in Abstract Argumentation Frameworks. In Proceedings of the 11th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management (IC3K 2019) - Volume 2: KEOD; ISBN 978-989-758-382-7, SciTePress, pages 67-75. DOI: 10.5220/0008064300670075

in Bibtex Style

@conference{keod19,
author={Samer Nofal and Katie Atkinson and Paul E. Dunne},
title={On Deciding Admissibility in Abstract Argumentation Frameworks},
booktitle={Proceedings of the 11th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management (IC3K 2019) - Volume 2: KEOD},
year={2019},
pages={67-75},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0008064300670075},
isbn={978-989-758-382-7},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 11th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management (IC3K 2019) - Volume 2: KEOD
TI - On Deciding Admissibility in Abstract Argumentation Frameworks
SN - 978-989-758-382-7
AU - Nofal S.
AU - Atkinson K.
AU - Dunne P.
PY - 2019
SP - 67
EP - 75
DO - 10.5220/0008064300670075
PB - SciTePress