Booth, RichardCaminada, MartinDunne, PaulPodlaszewski, MikolajRahwan, IyadParsons, SimonOren, NirReed, ChrisCerutti, Frederico2014-10-302014-10-302014Booth, 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-17397816149943509781614994367http://hdl.handle.net/2164/379311141926engargumentation frameworkslabelling schemescomputational complexityQA75 Electronic computers. Computer scienceQA75Conference item10.3233/978-1-61499-436-7-173266