The traditional Dung networks depict arguments as atomic and study the relationships of attack between them. This can be generalised in two ways. One is to consider various forms of attack, support, feedback, etc. Another is to add content to nodes and put there not just atomic arguments but more structure, e.g. proofs in some logic or simply just formulas from a richer language. This paper offers to use temporal and modal language formulas to represent arguments in the nodes of a network. The suitable semantics for such networks is Kripke semantics. We also introduce a new key concept of usability of an argument. This is the beginning of a continuing research for adding contents to the nodes of an argumentation network. This research will allow us to address notions like what does it exactly mean for a node to attack another or what does it mean for a network to be consistent or can we give proper proof rules to manipulate networks, and more. © 2012 Copyright Taylor and Francis Group, LLC.
CITATION STYLE
Barringer, H., Gabbay, D. M., & Woods, J. (2012). Modal and temporal argumentation networks. Argument and Computation, 3(2–3), 203–227. https://doi.org/10.1080/19462166.2012.704399
Mendeley helps you to discover research relevant for your work.