Reaching agreements through argumentation: a logical model and implementation
Artificial Intelligence
ACM Computing Surveys (CSUR)
Explanations, belief revision and defeasible reasoning
Artificial Intelligence
Inferring from Inconsistency in Preference-Based Argumentation Frameworks
Journal of Automated Reasoning
Two party immediate response disputes: properties and efficiency
Artificial Intelligence
Defeasible logic programming: an argumentative approach
Theory and Practice of Logic Programming
A Logic of Multiple-Valued Argumentation
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
A unified and general framework for argumentation-based negotiation
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Combining sceptical epistemic reasoning with credulous practical reasoning
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Argument theory change applied to defeasible logic programming
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
A lattice-based approach to computing warranted beliefs in skeptical argumentation frameworks
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
ArgMAS'04 Proceedings of the First international conference on Argumentation in Multi-Agent Systems
Dynamics of argumentation systems: A division-based method
Artificial Intelligence
Argumentation system allowing suspend/resume of an argumentation line
ArgMAS'10 Proceedings of the 7th international conference on Argumentation in Multi-Agent Systems
A semantics for dynamic argumentation frameworks
ArgMAS'11 Proceedings of the 8th international conference on Argumentation in Multi-Agent Systems
Hi-index | 0.00 |
This paper discusses a process of argumentation. We propose an algorithm for dynamic treatment of argumentation in which all lines of argumentation are executed in succession, and the agent's knowledge base can change during argumentation. We show that there exists a case in which an agent dynamically loses argumentation that would be considered won by a static analysis. We also show that the algorithm terminates, and describe acceptable arguments that are obtained after the argumentation.