Abstract argumentation frameworks with fallible evidence

DOI10.3233/FAIA200518MaRDI QIDQ5145817zbMATH OpenFDO

Authors Kenneth Skiba, Matthias Thimm, Andrea Cohen, Sebastian Gottifredi, Alejandro J. García

Publication date 21 January 2021

Full work available at URL https://doi.org/10.3233/FAIA200518

zbMATH Keywords

computational complexityabstract argumentationevidence retrieval cost

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30) Logic in artificial intelligence (68T27)

Recommendations

• Abduction in argumentation frameworks
• Credulous and skeptical acceptance in incomplete argumentation frameworks
• Acceptance in incomplete argumentation frameworks
• Complexity of abstract argumentation under a claim-centric view
• Complexity-sensitive decision procedures for abstract argumentation

Cited in

(8)

• Assessing arguments with schemes and fallacies
• Logics in Artificial Intelligence
• Towards Evidence Retrieval Cost Reduction in Abstract Argumentation Frameworks with Fallible Evidence
• Evidence-based argumentation and its incremental semantics
• Subjective logic and arguing with evidence
• A comprehensive account of the burden of persuasion in abstract argumentation
• scientific article; zbMATH DE number 7582524 (Why is no real title available?)
• Defence outsourcing in argumentation

This page was built for publication: Abstract argumentation frameworks with fallible evidence

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