Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation

DOI10.1613/JAIR.5415zbMATH Open1418.68196OpenAlexW2561997573MaRDI QIDQ5371007FDOQ5371007

Andreas Niskanen, Johannes 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)

Cited In (17)

• Abstract Argumentation in Dynamic Logic: Representation, Reasoning and Change
• Equivalence in argumentation frameworks with a claim-centric view: classical results with novel ingredients
• Taking into account ``who said what in abstract argumentation: complexity results
• Extended McCormick relaxation rules for handling empty arguments representing infeasibility
• Acceptance in incomplete argumentation frameworks
• A logical encoding for \(k\)-\(m\)-realization of extensions in abstract argumentation
• Topological conditions and solutions for repairing argumentation frameworks
• Extension-based semantics for incomplete argumentation frameworks: properties, complexity and algorithms
• Complexity of nonemptiness in control argumentation frameworks
• Constrained incomplete argumentation frameworks
• The complexity landscape of claim-augmented argumentation frameworks
• Title not available (Why is that?)
• Complexity-sensitive decision procedures for abstract argumentation
• Complexity of Possible and Necessary Existence Problems in Abstract Argumentation
• On dynamics in structured argumentation formalisms
• How can you resolve a trilemma? A topological approach
• Verification in incomplete argumentation frameworks

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

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