Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation

DOI10.1613/JAIR.5415zbMath1418.68196OpenAlexW2561997573MaRDI QIDQ5371007

Andreas Niskanen, Johannes Peter Wallner, Matti Järvisalo

Publication date: 24 October 2017

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.5415

Mathematics Subject Classification ID

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

Related Items (11)

Constrained incomplete argumentation frameworks ⋮ The complexity landscape of claim-augmented argumentation frameworks ⋮ Taking into account ``who said what in abstract argumentation: complexity results ⋮ A logical encoding for \(k\)-\(m\)-realization of extensions in abstract argumentation ⋮ Topological conditions and solutions for repairing argumentation frameworks ⋮ How can you resolve a trilemma? A topological approach ⋮ Verification in incomplete argumentation frameworks ⋮ Abstract Argumentation in Dynamic Logic: Representation, Reasoning and Change ⋮ Acceptance in incomplete argumentation frameworks ⋮ On dynamics in structured argumentation formalisms ⋮ Equivalence in argumentation frameworks with a claim-centric view: classical results with novel ingredients

This page was built for publication: Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation