| Reference : Introducing Equational Semantics for Argumentation Networks |
| Scientific congresses, symposiums and conference proceedings : Paper published in a book | |||
| Engineering, computing & technology : Computer science | |||
| http://hdl.handle.net/10993/15872 | |||
| Introducing Equational Semantics for Argumentation Networks | |
| English | |
| 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] | |
| 2011 | |
| ECSQARU | |
| Springer | |
| Lecture Notes in Computer Science 6717 | |
| 19–35 | |
| Yes | |
| 978-3-642-22151-4 | |
| ECSQARU | |
| 2011 | |
| [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. | |
| http://hdl.handle.net/10993/15872 | |
| 10.1007/978-3-642-22152-1\_2 | |
| 6717 |
| File(s) associated to this reference | ||||||||||||||
|
Fulltext file(s):
| ||||||||||||||
All documents in ORBilu are protected by a user license.
