Show simple item record

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.date.accessioned2014-10-30T16:09:00Z
dc.date.available2014-10-30T16:09:00Z
dc.date.issued2014
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.isbn9781614994350
dc.identifier.isbn9781614994367
dc.identifier.otherPURE: 43200877
dc.identifier.otherPURE UUID: 6988e590-ad73-40e4-b290-d913d8fb88b1
dc.identifier.otherScopus: 84940552961
dc.identifier.urihttp://hdl.handle.net/2164/3793
dc.format.extent11
dc.language.isoeng
dc.publisherIOS Press
dc.relation.ispartofComputational Models of Argumenten
dc.rightsThis is the author's accepted manuscript of a paper later published in Computational Models of Argument: Proceedings of COMMA 2014, IOS Press. Available through http://dx.doi.org/10.3233/978-1-61499-436-7-173en
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
dc.contributor.institutionUniversity of Aberdeen.Computing Scienceen
dc.description.versionPostprinten
dc.identifier.doihttps://doi.org/10.3233/978-1-61499-436-7-173


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record