Two approaches to the problems of self-attacking arguments and general odd-length cycles of attack
DOI10.1016/J.JAL.2007.06.012zbMATH Open1189.03006OpenAlexW1980618078MaRDI QIDQ846524FDOQ846524
Authors: Fernando Tohmé, Gustavo Adrián Bodanza 
Publication date: 9 February 2010
Published in: Journal of Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jal.2007.06.012
Recommendations
- The ``lottery paradox paradox and other self-attacking arguments from the point of view of defeasible argumentation frameworks
- Solving semantic problems with odd-length cycles in argumentation
- On the acceptance of loops in argumentation frameworks
- Conflict-tolerant semantics for argumentation frameworks
- Beyond admissibility: accepting cycles in argumentation with game protocols for cogency criteria
game theorylottery paradoxargumentation frameworkscredulous semanticsodd-length cycles of attackself-attacking arguments
Philosophical and critical aspects of logic and foundations (03A05) Logic in artificial intelligence (68T27)
Cites Work
- Abstract argumentation systems
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- A course in game theory.
- A mathematical treatment of defeasible reasoning and its implementation.
- On the evaluation of argumentation formalisms
- A reasoning model based on the production of acceptable arguments
- Coherence and Flexibility in Dialogue Games for Argumentation
- Persuasion in Practical Argument Using Value-based Argumentation Frameworks
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- SCC-recursiveness: a general schema for argumentation semantics
- Robust semantics for argumentation frameworks
- Solving semantic problems with odd-length cycles in argumentation
- Title not available (Why is that?)
- Justification and defeat
Cited In (13)
- Conflict-tolerant semantics for argumentation frameworks
- Iterated admissibility through forcing in strategic belief models
- Principles of Talmudic logic
- Dilemmas and paradoxes: cycles in argumentation frameworks
- Beyond admissibility: accepting cycles in argumentation with game protocols for cogency criteria
- A Principle-based Account of Self-attacking Arguments in Gradual Semantics
- Minimal hypotheses: extension-based semantics to argumentation
- Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility
- Solving semantic problems with odd-length cycles in argumentation
- On restricting the impact of self-attacking arguments in gradual semantics
- The ``lottery paradox paradox and other self-attacking arguments from the point of view of defeasible argumentation frameworks
- On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation
- Weak argumentation semantics and unsafe odd cycles: results and a conjecture
This page was built for publication: Two approaches to the problems of self-attacking arguments and general odd-length cycles of attack
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q846524)
