Two party immediate response disputes: Properties and efficiency

DOI10.1016/S0004-3702(03)00076-6zbMath1082.68819WikidataQ58168640 ScholiaQ58168640MaRDI QIDQ814510

Paul E. Dunne, Trevor J. M. Bench-Capon

Publication date: 7 February 2006

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

Gentzen system; Proof complexity; Argument systems; Dialogue game

Mathematics Subject Classification ID

68T27: Logic in artificial intelligence

03F20: Complexity of proofs

Related Items

Audiences in argumentation frameworks, Argumentation in artificial intelligence, Computing ideal sceptical argumentation, Computational properties of argument systems satisfying graph-theoretic constraints, The computational complexity of ideal semantics, Coherence in finite argument systems., Dialectic proof procedures for assumption-based, admissible argumentation, Self-stabilizing defeat status computation: dealing with conflict management in multi-agent systems, A formal account of Socratic-style argumentation, Dialectical Proof Theories for the Credulous Prudent Preferred Semantics of Argumentation, Extracting the Core of a Persuasion Dialog to Evaluate Its Quality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph theoretical structures in logic programs and default theories
• The intractability of resolution
• Question-begging in non-cumulative systems
• The complexity of Gentzen systems for propositional logic
• Gentzen-type systems, resolution and tableaux
• The complexity of the pigeonhole principle
• An abstract, argumentation-theoretic approach to default reasoning
• Coherence in finite argument systems.
• On the computational complexity of assumption-based argumentation for default reasoning.
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• An exponential separation between the parity principle and the pigeonhole principle
• Argument-based extended logic programming with defeasible priorities
• Determining the Stability Number of a Graph
• The relative efficiency of propositional proof systems
• Defeasible Dialectics: A Controversy-Oriented Approach towards Defeasible Argumentation
• Lower bounds for cutting planes proofs with small coefficients
• The Complexity of the Hajós Calculus
• The Complexity of Propositional Proofs