Deliberative acceptability of arguments

MaRDI QIDQ4583949zbMATH OpenFDO

Authors Cosmina Croitoru, Timo K. Ötzing

Publication date 29 August 2018

Full work available at URL http://ebooks.iospress.nl/volumearticle/6904

zbMATH Keywords

abstract argumentationargument acceptabilitycomputational properties of argumentation

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Computational properties of argument systems satisfying graph-theoretic constraints
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Indepth combinatorial analysis of admissible sets for abstract argumentation
• On computing the set of acceptable arguments in abstract argumentation
• Coherence in finite argument systems.

Cited in

(7)

• Credible debate equilibria
• Coherence in finite argument systems.
• Indepth combinatorial analysis of admissible sets for abstract argumentation
• Beyond admissibility: accepting cycles in argumentation with game protocols for cogency criteria
• Handling controversial arguments
• A dialectical proof theory for universal acceptance in coherent logic-based argumentation frameworks
• The complexity of debate checking

This page was built for publication: Deliberative acceptability of arguments

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