The complexity of Gentzen systems for propositional logic
Theoretical Computer Science
Exponential lower bounds for the pigeonhole principle
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The Complexity of the Hajos Calculus
SIAM Journal on Discrete Mathematics
Graph theoretical structures in logic programs and default theories
Theoretical Computer Science
An abstract, argumentation-theoretic approach to default reasoning
Artificial Intelligence
Dialectic semantics for argumentation frameworks
ICAIL '99 Proceedings of the 7th international conference on Artificial intelligence and law
Pleadings Game: An Artificial Intelligence Model of Procedural Justice
Pleadings Game: An Artificial Intelligence Model of Procedural Justice
On the computational complexity of assumption-based argumentation for default reasoning
Artificial Intelligence
Coherence in finite argument systems
Artificial Intelligence
Preferred Arguments are Harder to Compute than Stable Extension
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Dialogue Frames in Agent Communication
ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems
Graphs and Hypergraphs
Prevarication in dispute protocols
ICAIL '03 Proceedings of the 9th international conference on Artificial intelligence and law
Dialectic proof procedures for assumption-based, admissible argumentation
Artificial Intelligence
Try to see it my way: modelling persuasion in legal discourse
Artificial Intelligence and Law
Audiences in argumentation frameworks
Artificial Intelligence
Argumentation in artificial intelligence
Artificial Intelligence
Computing ideal sceptical argumentation
Artificial Intelligence
Computational properties of argument systems satisfying graph-theoretic constraints
Artificial Intelligence
Modelling coalitions: ATL + argumentation
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
A Game-Theoretic Measure of Argument Strength for Abstract Argumentation
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Dialectical Proof Theories for the Credulous Prudent Preferred Semantics of Argumentation
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
An Argumentative Approach for Modelling Coalitions Using ATL
Argumentation in Multi-Agent Systems
Autonomous Agents and Multi-Agent Systems
Complexity Properties of Restricted Abstract Argument Systems
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
An algorithm to compute minimally grounded and admissible defence sets in argument systems
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Handling controversial arguments in bipolar argumentation systems
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Combining sceptical epistemic reasoning with credulous practical reasoning
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Integrating Object and Meta-Level Value Based Argumentation
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Case law in extended argumentation frameworks
Proceedings of the 12th International Conference on Artificial Intelligence and Law
Extracting the Core of a Persuasion Dialog to Evaluate Its Quality
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
A labeling approach to the computation of credulous acceptance in argumentation
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Explaining preferences with argument positions
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Dialectic proof procedures for assumption-based, admissible argumentation
Artificial Intelligence
The computational complexity of ideal semantics
Artificial Intelligence
Argumentation system with changes of an agent's knowledge base
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Agreeing on plans through iterated disputes
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
An Argumentation-Based Dialog for Social Evaluations Exchange
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Handling enthymemes in time-limited persuasion dialogs
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Determining preferences through argumentation
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
A generative dialogue system for arguing about plans in situation calculus
ArgMAS'09 Proceedings of the 6th international conference on Argumentation in Multi-Agent Systems
Argumentation system allowing suspend/resume of an argumentation line
ArgMAS'10 Proceedings of the 7th international conference on Argumentation in Multi-Agent Systems
Computing argumentation in polynomial number of BDD operations: a preliminary report
ArgMAS'10 Proceedings of the 7th international conference on Argumentation in Multi-Agent Systems
Arguments over co-operative plans
TAFA'11 Proceedings of the First international conference on Theory and Applications of Formal Argumentation
A generalised framework for dispute derivations in assumption-based argumentation
Artificial Intelligence
Arguing about social evaluations: From theory to experimentation
International Journal of Approximate Reasoning
Automata for infinite argumentation structures
Artificial Intelligence
Algorithms for decision problems in argument systems under preferred semantics
Artificial Intelligence
| Hi-index | 0.00 |
Two Party Immediate Response Disputes (TPI-disputes) are one class of dialogue or argument game in which the protagonists take turns producing counter arguments to the 'most recent' argument advanced by their opponent. Argument games have been found useful as a means of modelling dialectical discourse and in providing semantic bases for proof theoretic aspects of reasoning. In this article we consider a formalisation of TPI-disputes in the context of finite Argument Systems. Our principal concern may, informally, be phrased as follows: given a specific argument system, H, and argument x within H, what can be stated concerning the number of moves a dispute might take for one of its protagonists to accept that x has some defence respectively cannot be defended?