Equational approach to argumentation networks

Abstract

This paper provides equational semantics for Dung's argumentation networks. The network nodes get numerical values in [0,1], 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, dependence on time, and much more. The equational approach has its conceptual roots in the nineteenth century following the algebraic equational approach to logic by George Boole, Louis Couturat, and Ernst Schroeder. © 2012 Copyright Taylor and Francis Group, LLC.