Show simple item record

dc.contributor.authorCaminada, Martin
dc.contributor.editorParsons, Simon
dc.contributor.editorOren, Nir
dc.contributor.editorReed, Chris
dc.contributor.editorCerutti, Frederico
dc.date.accessioned2014-10-30T16:08:00Z
dc.date.available2014-10-30T16:08:00Z
dc.date.issued2014
dc.identifier43201076
dc.identifierdb2e6fb2-2797-4d3d-88a6-46108f2f255a
dc.identifier84940560283
dc.identifier.citationCaminada , 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-197en
dc.identifier.isbn9781614994350
dc.identifier.isbn9781614994367
dc.identifier.urihttp://hdl.handle.net/2164/3792
dc.format.extent12
dc.format.extent133733
dc.language.isoeng
dc.publisherIOS Press
dc.relation.ispartofComputational Models of Argumenten
dc.relation.ispartofseriesFrontiers in Artificial Intelligence and Applicationsen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subject.lccQA75en
dc.titleStrong Admissibility Revisiteden
dc.typeConference itemen
dc.contributor.institutionUniversity of Aberdeen.Computing Scienceen
dc.identifier.doi10.3233/978-1-61499-436-7-197


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record