Strong Admissibility Revisited
| dc.contributor.author | Caminada, Martin | |
| dc.contributor.editor | Parsons, Simon | |
| dc.contributor.editor | Oren, Nir | |
| dc.contributor.editor | Reed, Chris | |
| dc.contributor.editor | Cerutti, Frederico | |
| dc.contributor.institution | University of Aberdeen.Computing Science | en |
| dc.date.accessioned | 2014-10-30T16:08:00Z | |
| dc.date.available | 2014-10-30T16:08:00Z | |
| dc.date.issued | 2014 | |
| dc.format.extent | 12 | |
| dc.format.extent | 133733 | |
| dc.identifier | 43201076 | |
| dc.identifier | db2e6fb2-2797-4d3d-88a6-46108f2f255a | |
| dc.identifier | 84940560283 | |
| dc.identifier.citation | Caminada, M 2014, Strong Admissibility Revisited. in S Parsons, N Oren, C Reed & F Cerutti (eds), Computational Models of Argument : Proceedings of COMMA 2014. Frontiers in Artificial Intelligence and Applications, vol. 266, IOS Press, Amsterdam, pp. 197-208. https://doi.org/10.3233/978-1-61499-436-7-197 | en |
| dc.identifier.doi | 10.3233/978-1-61499-436-7-197 | |
| dc.identifier.isbn | 9781614994350 | |
| dc.identifier.isbn | 9781614994367 | |
| dc.identifier.uri | http://hdl.handle.net/2164/3792 | |
| dc.identifier.vol | 266 | en |
| dc.language.iso | eng | |
| dc.publisher | IOS Press | |
| dc.relation.ispartof | Computational Models of Argument | en |
| dc.relation.ispartofseries | Frontiers in Artificial Intelligence and Applications | en |
| dc.subject | QA75 Electronic computers. Computer science | en |
| dc.subject.lcc | QA75 | en |
| dc.title | Strong Admissibility Revisited | en |
| dc.type | Conference item | en |