Two party immediate response disputes: Properties and efficiency
From MaRDI portal
Publication:814510
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
Cites work
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 67448 (Why is no real title available?)
- scientific article; zbMATH DE number 1215500 (Why is no real title available?)
- scientific article; zbMATH DE number 1179974 (Why is no real title available?)
- scientific article; zbMATH DE number 1759381 (Why is no real title available?)
- scientific article; zbMATH DE number 1390276 (Why is no real title available?)
- scientific article; zbMATH DE number 3274715 (Why is no real title available?)
- An abstract, argumentation-theoretic approach to default reasoning
- An exponential separation between the parity principle and the pigeonhole principle
- Argument-based extended logic programming with defeasible priorities
- Coherence in finite argument systems.
- Defeasible Dialectics: A Controversy-Oriented Approach towards Defeasible Argumentation
- Determining the Stability Number of a Graph
- Gentzen-type systems, resolution and tableaux
- Graph theoretical structures in logic programs and default theories
- Lower bounds for cutting planes proofs with small coefficients
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- On the computational complexity of assumption-based argumentation for default reasoning.
- Question-begging in non-cumulative systems
- The Complexity of Propositional Proofs
- The Complexity of the Hajós Calculus
- The complexity of Gentzen systems for propositional logic
- The complexity of the pigeonhole principle
- The intractability of resolution
- The relative efficiency of propositional proof systems
Cited in
(19)- Extracting the Core of a Persuasion Dialog to Evaluate Its Quality
- 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
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)
