TY - GEN
T1 - Modal and temporal argumentation networks
AU - Barringer, Howard
AU - Gabbay, Dov M.
PY - 2010
Y1 - 2010
N2 - The traditional Dung networks depict arguments as atomic and studies the relationships of attack between them. This can be generalised in two ways. One is to consider, for example, various forms of attack, support and feedback. Another is to add content to nodes and put there not just atomic arguments but more structure, for example, 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.
AB - The traditional Dung networks depict arguments as atomic and studies the relationships of attack between them. This can be generalised in two ways. One is to consider, for example, various forms of attack, support and feedback. Another is to add content to nodes and put there not just atomic arguments but more structure, for example, 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.
UR - http://www.scopus.com/inward/record.url?scp=77955044336&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-13754-9_1
DO - 10.1007/978-3-642-13754-9_1
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:77955044336
SN - 3642137539
SN - 9783642137532
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1
EP - 25
BT - Time for Verification - Essays in Memory of Amir Pnueli
A2 - Manna, Zohar
A2 - Peled, Doron A.
ER -