[en] 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.
Disciplines :
Computer science
Identifiers :
UNILU:UL-CONFERENCE-2011-349
Author, co-author :
GABBAY, Dov M. ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) ; King’s College London, Department of Computer Science, London, UK ; Bar-Ilan University, Ramat-Gan, Israel
Language :
English
Title :
Introducing Equational Semantics for Argumentation Networks
