introducing equational semantics for argumentation networks文档.pdfVIP

Introducing Equational Semantics for Argumentation Networks Dov M. Gabbay 1 King’s College London   2 Bar Ilan University Israel 3 University of Luxembourg 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, etc, etc. The equational approach has its conceptual roots in the 19th century following the algebraic equational approach to logic by George Boole, Louis Couturat and Ernst Schroeder. 1 Introduction [ ] This paper is a short version of 11 , which expands (as promised) on our equational [ ] ideas introduced in pages 246–251 of 9 . The Equational approach has its conceptual roots in the 19th century following the algebraic equational approach to logic by George [ ] [ ] [ ] Boole 2 , Louis Couturat 4 and Ernst Schroeder 13 . The equational algebraic approach was historically followed, in the first half of the 20th century by the Logical Truth (Tautologies) approach supported by giants such as G. Frege, D. Hilbert, B. Russell and L. Wittgenstein. In the second half of the twentieth C