Complexity Properties of Critical Sets of Arguments
| dc.contributor.author | Booth, Richard | |
| dc.contributor.author | Caminada, Martin | |
| dc.contributor.author | Dunne, Paul | |
| dc.contributor.author | Podlaszewski, Mikolaj | |
| dc.contributor.author | Rahwan, Iyad | |
| dc.contributor.editor | Parsons, Simon | |
| dc.contributor.editor | Oren, Nir | |
| dc.contributor.editor | Reed, Chris | |
| dc.contributor.editor | Cerutti, Frederico | |
| dc.date.accessioned | 2014-10-30T16:09:00Z | |
| dc.date.available | 2014-10-30T16:09:00Z | |
| dc.date.issued | 2014 | |
| dc.identifier | 43200877 | |
| dc.identifier | 6988e590-ad73-40e4-b290-d913d8fb88b1 | |
| dc.identifier | 84940552961 | |
| dc.identifier.citation | Booth , 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-173 | en |
| dc.identifier.isbn | 9781614994350 | |
| dc.identifier.isbn | 9781614994367 | |
| dc.identifier.uri | http://hdl.handle.net/2164/3793 | |
| dc.format.extent | 11 | |
| dc.format.extent | 141926 | |
| dc.language.iso | eng | |
| dc.publisher | IOS Press | |
| dc.relation.ispartof | Computational Models of Argument | en |
| dc.subject | argumentation frameworks | en |
| dc.subject | labelling schemes | en |
| dc.subject | computational complexity | en |
| dc.subject | QA75 Electronic computers. Computer science | en |
| dc.subject.lcc | QA75 | en |
| dc.title | Complexity Properties of Critical Sets of Arguments | en |
| dc.type | Conference item | en |
| dc.contributor.institution | University of Aberdeen.Computing Science | en |
| dc.identifier.doi | 10.3233/978-1-61499-436-7-173 |