Two party immediate response disputes: Properties and efficiency

DOI10.1016/S0004-3702(03)00076-6zbMATH Open1082.68819WikidataQ58168640 ScholiaQ58168640MaRDI QIDQ814510FDOQ814510

Authors: Paul E. Dunne, Trevor Bench-Capon 

Publication date: 7 February 2006

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

Recommendations

• Relating protocols for dynamic dispute with logics for defeasible argumentation
• scientific article; zbMATH DE number 7599965
• Dynamic argument systems: A formal model of argumentation processes based on situation calculus
• Theory of disjunctive attacks, Part I
• Eight dialectic benchmarks discussed by two artificial localist disputors

zbMATH Keywords

Gentzen systemProof complexityArgument systemsDialogue game

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Complexity of proofs (03F20)

Cites Work

• An abstract, argumentation-theoretic approach to default reasoning
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The relative efficiency of propositional proof systems
• The Complexity of Propositional Proofs
• Lower bounds for cutting planes proofs with small coefficients
• Title not available (Why is that?)
• Argument-based extended logic programming with defeasible priorities
• Coherence in finite argument systems.
• Graph theoretical structures in logic programs and default theories
• The intractability of resolution
• Gentzen-type systems, resolution and tableaux
• The complexity of the pigeonhole principle
• An exponential separation between the parity principle and the pigeonhole principle
• Defeasible Dialectics: A Controversy-Oriented Approach towards Defeasible Argumentation
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Complexity of the Hajós Calculus
• Determining the Stability Number of a Graph
• The complexity of Gentzen systems for propositional logic
• Title not available (Why is that?)
• Question-begging in non-cumulative systems

Cited In (19)

• A postulate-driven study of logical argumentation
• Argumentation in artificial intelligence
• Computing ideal sceptical argumentation
• The computational complexity of ideal semantics
• Incremental computation of deterministic extensions for dynamic argumentation frameworks
• Self-stabilizing defeat status computation: dealing with conflict management in multi-agent systems
• A formal account of Socratic-style argumentation
• Arguing about social evaluations: from theory to experimentation
• Logical argumentation by dynamic proof systems
• Dialectical Proof Theories for the Credulous Prudent Preferred Semantics of Argumentation
• Dialectic proof procedures for assumption-based, admissible argumentation
• Algorithms for decision problems in argument systems under preferred semantics
• Logic-based argumentation with existential rules
• Computational properties of argument systems satisfying graph-theoretic constraints
• Uses and computation of imprecise probabilities from statistical data and expert arguments
• Audiences in argumentation frameworks
• Coherence in finite argument systems.
• A puzzle about disputes and disagreements
• Extracting the Core of a Persuasion Dialog to Evaluate Its Quality

This page was built for publication: Two party immediate response disputes: Properties and efficiency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814510)