A temporal argumentative system
AI Communications
On the evaluation of argumentation formalisms
Artificial Intelligence
An Algorithm for Computing Semi-stable Semantics
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Argumentation Using Temporal Knowledge
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
On the issue of reinstatement in argumentation
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Temporal accommodation of legal argumentation
Proceedings of the 13th International Conference on Artificial Intelligence and Law
TAFA'11 Proceedings of the First international conference on Theory and Applications of Formal Argumentation
Global view on reactivity: switch graphs and their logics
Annals of Mathematics and Artificial Intelligence
Computing temporal defeasible logic
RuleML'13 Proceedings of the 7th international conference on Theory, Practice, and Applications of Rules on the Web
| Hi-index | 0.00 |
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.