Equational Approach to Argumentation Networks D. M. Gabbay Abstract This paper provides equational semantics for Dung s argumentation networks. The network nodes get numerical values in [0,1] or in any algebra A, and are supposed to satisfy certain equations. The solutions to these equations correspond to the extensions of the network. This approach is very general and includes the Caminada labelling as a special case, as well as many other so-called network extensions, support systems, higher level attacks, Boolean networks, etc, etc.