In this paper we conceptualize abstract argumentation in terms of successful and unsuccessful attacks, such that arguments are accepted when there are no successful attacks on them. We define an SCC recursive algorithm for attack semantics using labeling, we characterize the relation between attack semantics and earlier approaches, and we sketch how attack semantics can be generalized for applications in belief revision, dataflow network reasoning and judgment aggregation.