University of Aberdeen logo

AURA - Aberdeen University Research Archive

 

Complexity Properties of Critical Sets of Arguments

Simple item page
dc.contributor.authorBooth, Richard
dc.contributor.authorCaminada, Martin
dc.contributor.authorDunne, Paul
dc.contributor.authorPodlaszewski, Mikolaj
dc.contributor.authorRahwan, Iyad
dc.contributor.editorParsons, Simon
dc.contributor.editorOren, Nir
dc.contributor.editorReed, Chris
dc.contributor.editorCerutti, Frederico
dc.contributor.institutionUniversity of Aberdeen.Computing Scienceen
dc.date.accessioned2014-10-30T16:09:00Z
dc.date.available2014-10-30T16:09:00Z
dc.date.issued2014
dc.format.extent11
dc.format.extent141926
dc.identifier43200877
dc.identifier6988e590-ad73-40e4-b290-d913d8fb88b1
dc.identifier84940552961
dc.identifier.citationBooth, R, Caminada, M, Dunne, P, Podlaszewski, M & Rahwan, I 2014, Complexity Properties of Critical Sets of Arguments. in S Parsons, N Oren, C Reed & F Cerutti (eds), Computational Models of Argument : Proceedings of COMMA 2014. vol. 266, IOS Press, Amsterdam, pp. 173-184. https://doi.org/10.3233/978-1-61499-436-7-173en
dc.identifier.doi10.3233/978-1-61499-436-7-173
dc.identifier.isbn9781614994350
dc.identifier.isbn9781614994367
dc.identifier.urihttp://hdl.handle.net/2164/3793
dc.identifier.vol266en
dc.language.isoeng
dc.publisherIOS Press
dc.relation.ispartofComputational Models of Argumenten
dc.subjectargumentation frameworksen
dc.subjectlabelling schemesen
dc.subjectcomputational complexityen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subject.lccQA75en
dc.titleComplexity Properties of Critical Sets of Argumentsen
dc.typeConference itemen

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
ComplexityCritSetCOMMA14.pdf
Size:
138.6 KB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
8.32 KB
Format:
Plain Text
Description:
Download

Collections

All research
Computing Science research
University Office research