Well, to Be Honest, I Wouldnt Start from Here at All

Dunne, Paul E ORCID: 0000-0002-6033-3742 (2022) Well, to Be Honest, I Wouldnt Start from Here at All. In: Computational Models of Argument, 2022-9-14 - 2022-12-16, University of Cardiff.

PDF
FAIA-353-FAIA220134.pdf - Published version
Download (299kB) | Preview

Official URL: http://dx.doi.org/10.3233/faia220134

Abstract

<jats:p>Computational complexity theory and the related area of efficient algorithms have formed significant subfields of Abstract Argumentation going back over 20 years. There have been major contributions and an increased understanding of the computational issues that influence and beset effective implementation of argument methods. My aim, in this article, is to attempt to take stock of the standing of work in complexity theory as it presently is within the field of Computational Argument, as well as offering some personal views on its future direction.</jats:p>

Item Type:	Conference or Workshop Item (Unspecified)
Depositing User:	Symplectic Admin
Date Deposited:	15 Dec 2022 09:37
Last Modified:	21 Aug 2023 13:18
DOI:	10.3233/faia220134
Related URLs:	Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3166669