Strong refinements for hard problems in argumentation dynamics

DOI10.3233/FAIA200174MaRDI QIDQ4999289zbMATH OpenOpenAlexFDO

Authors Andreas Niskanen, Matti Järvisalo

Publication date 6 July 2021

Full work available at URL https://dblp.uni-trier.de/db/conf/ecai/ecai2020.html#NiskanenJ20

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Complexity results and algorithms for extension enforcement in abstract argumentation
• SAT-based approaches to adjusting, repairing, and computing largest extensions of argumentation frameworks
• Complexity-sensitive decision procedures for abstract argumentation
• Incremental computation of deterministic extensions for dynamic argumentation frameworks
• The complexity of repairing, adjusting, and aggregating of extensions in abstract argumentation

Cited in

(6)

• Structured argumentation dynamics. Undermining attacks in default justification logic
• A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence
• Acceptance in incomplete argumentation frameworks
• SAT-based approaches to adjusting, repairing, and computing largest extensions of argumentation frameworks
• scientific article; zbMATH DE number 6747923 (Why is no real title available?)
• Complexity results and algorithms for extension enforcement in abstract argumentation

This page was built for publication: Strong refinements for hard problems in argumentation dynamics

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