Graph spanners are sparse subgraphs that preserve the distances of the original graph, up to some small multiplicative factor or additive term (known as the stretch of the spanner). A number of algorithms are known for constructing sparse spanners with small multiplicative or additive stretch. Recently, the problem of constructing fault-tolerant multiplicative spanners for general graphs was given some algorithms. This paper addresses the analogous problem of constructing fault tolerant additive spanners for general graphs. We establish the following general result. Given an n-vertex graph G, if H 1 is an ordinary additive spanner for G with additive stretch α, and H 2 is a fault tolerant multiplicative spanner for G, resilient against up to f edge failures, with multiplicative stretch μ, then H∈=∈H 1∈∪∈H 2 is an additive fault tolerant spanner of G, resilient against up to f edge failures, with additive stretch where is the number of failures that have actually occurred. This allows us to derive a poly-time algorithm for constructing an additive fault tolerant spanner H of G, relying on the existence of algorithms for constructing fault tolerant multiplicative spanners and (ordinary) additive spanners. In particular, based on some known spanner construction algorithms, we show how to construct for any n-vertex graph G an additive fault tolerant spanner with additive stretch and size O(fn 4/3).