Carneades ICCMA: A Straightforward Implementation of a Solver for Abstract Argumentation in the Go Programming Language. The Carneades entry to the 2015 International Competition on Computational Models of Argument (ICCMA) is a straight-forward implementation of a solver for reasoning tasks in abstract argumentation frameworks [1]. All of the reasoning tasks (computing one or all extensions and deciding whether an argument is credulously or skeptically inferred) and Dung semantics (grounded, complete, preferred, stable) covered by the competition have been implemented. The solver has been implemented in Go, a mainstream statically-typed, procedural programming language with a C-like syntax, garbage collection, good builtin support for concurrency and a large standard library. The aim is to provide a concise and readable implementation suitable for pedagogical purposes, using only common and widely familiar programming constructs and with no dependencies on external libraries or programs.