Equational approach to argumentation networks
Argument and Computation 3 (2-3):87 - 142 (2012)
| 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 | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,664 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesH. Barringer, D. M. Gabbay & J. Woods (2012). Temporal, Numerical and Meta-Level Dynamics in Argumentation Networks. Argument and Computation 3 (2-3):143 - 202.
Dov M. Gabbay (forthcoming). Semantics for Higher Level Attacks in Extended Argumentation Frames Part 1: Overview. Studia Logica.
Dov M. Gabbay (forthcoming). Fibring Argumentation Frames. Studia Logica.
H. Barringer, D. M. Gabbay & J. Woods (2012). Modal and Temporal Argumentation Networks. Argument and Computation 3 (2-3):203 - 227.
George Weaver (1994). A Note on Definability in Equational Logic. History and Philosophy of Logic 15 (2):189-199.
Markus Junker & Ingo Kraus (2002). Theories with Equational Forking. Journal of Symbolic Logic 67 (1):326-340.
Dov M. Gabbay & Artur S. D.’Avila Garcez (forthcoming). Logical Modes of Attack in Argumentation Networks. Studia Logica.
Dov M. Gabbay (forthcoming). Modal Provability Foundations for Argumentation Networks. Studia Logica.
Tomasz Furmanowski (1983). The Logic of Algebraic Rules as a Generalization of Equational Logic. Studia Logica 42 (2-3):251 - 257.
Arnold Beckmann (2002). Proving Consistency of Equational Theories in Bounded Arithmetic. Journal of Symbolic Logic 67 (1):279-296.
William Craig (1989). Near-Equational and Equational Systems of Logic for Partial Functions. I. Journal of Symbolic Logic 54 (3):795-827.
William Craig (1989). Near-Equational and Equational Systems of Logic for Partial Functions. II. Journal of Symbolic Logic 54 (4):1181-1215.
Analytics
Monthly downloads |
Added to index2012-07-26Total downloads5 ( #160,239 of 549,012 )Recent downloads (6 months)1 ( #63,261 of 549,012 )How can I increase my downloads? |
My notes
Discussion
