Algorithms for Acceptance in Argument Systems

Samer Nofal, Paul Dunne, Katie Atkinson

2013

Abstract

We introduce algorithms that decide arguments’ acceptance in Dung’s system of argumentation. Under \emph{preferred} semantics, there might be various extensions of acceptable arguments, and hence, the acceptance problem is concerned with deciding whether a given argument is in an extension or in all extensions. The new algorithms decide the acceptance without truly enumerating all extensions. This is of interest in situations where the acceptance problem is confined to a specific argument while the underlying argument system changes frequently such as in a dialog setting. We analyze our algorithms in contrast to existing algorithms. Consistent with experimental results, we argue that the new algorithms are more efficient with respect to running time.

Paper Citation

in Harvard Style

Nofal S., Dunne P. and Atkinson K. (2013). Algorithms for Acceptance in Argument Systems . In Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-8565-39-6, pages 34-43. DOI: 10.5220/0004192400340043

in Bibtex Style

@conference{icaart13,
author={Samer Nofal and Paul Dunne and Katie Atkinson},
title={Algorithms for Acceptance in Argument Systems},
booktitle={Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2013},
pages={34-43},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004192400340043},
isbn={978-989-8565-39-6},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Algorithms for Acceptance in Argument Systems
SN - 978-989-8565-39-6
AU - Nofal S.
AU - Dunne P.
AU - Atkinson K.
PY - 2013
SP - 34
EP - 43
DO - 10.5220/0004192400340043