Complexity of nonemptiness in control argumentation frameworks

DOI10.1007/978-3-030-86772-0_9OpenAlexW3201188833MaRDI QIDQ2146008

Jörg Rothe, Daniel Neugebauer, Kenneth Skiba

Publication date: 15 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-86772-0_9

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (1)

Taking into account ``who said what in abstract argumentation: complexity results

Cites Work

• Unnamed Item
• Unnamed Item
• Weighted argument systems: basic definitions, algorithms, and complexity results
• Verification in incomplete argumentation frameworks
• Graph theoretical structures in logic programs and default theories
• The polynomial-time hierarchy
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Complexity theory and cryptology. An introduction to cryptocomplexity.
• On the Complexity of Probabilistic Abstract Argumentation Frameworks
• Complexity of Possible and Necessary Existence Problems in Abstract Argumentation

This page was built for publication: Complexity of nonemptiness in control argumentation frameworks