Modal and temporal argumentation networks

Howard Barringer; Dov M. Gabbay

doi:10.1007/978-3-642-13754-9_1

Modal and temporal argumentation networks

Howard Barringer
, Dov M. Gabbay

Research output: Chapter in Book/Conference proceeding › Conference contribution › peer-review

Abstract

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. © 2010 Springer-Verlag Berlin Heidelberg.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)\|Lect. Notes Comput. Sci.
Publisher	Springer Nature
Pages	1-25
Number of pages	24
Volume	6200
ISBN (Print)	3642137539, 9783642137532
DOIs	https://doi.org/10.1007/978-3-642-13754-9_1
Publication status	Published - 2010

Access to Document

10.1007/978-3-642-13754-9_1

Cite this

@inproceedings{ca806af5bdc44393a1dd9b484ed97bb1,

title = "Modal and temporal argumentation networks",

abstract = "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. {\textcopyright} 2010 Springer-Verlag Berlin Heidelberg.",

author = "Howard Barringer and Gabbay, \{Dov M.\}",

year = "2010",

doi = "10.1007/978-3-642-13754-9\_1",

language = "English",

isbn = "3642137539",

volume = "6200",

pages = "1--25",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.",

publisher = "Springer Nature",

address = "United States",

}

Modal and temporal argumentation networks. / Barringer, Howard; Gabbay, Dov M.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.. Vol. 6200 Springer Nature, 2010. p. 1-25.

Research output: Chapter in Book/Conference proceeding › Conference contribution › peer-review

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. © 2010 Springer-Verlag Berlin Heidelberg.

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. © 2010 Springer-Verlag Berlin Heidelberg.

U2 - 10.1007/978-3-642-13754-9_1

DO - 10.1007/978-3-642-13754-9_1

M3 - Conference contribution

SN - 3642137539

SN - 9783642137532

VL - 6200

SP - 1

EP - 25

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.

PB - Springer Nature

ER -

Modal and temporal argumentation networks

Abstract

Access to Document

Fingerprint

Cite this