Complexity of Possible and Necessary Existence Problems in Abstract Argumentation
From MaRDI portal
Publication:4999294
DOI10.3233/FAIA200181zbMath1464.68373OpenAlexW3091309720MaRDI QIDQ4999294
Jörg Rothe, Kenneth Skiba, Daniel Neugebauer
Publication date: 6 July 2021
Full work available at URL: https://dblp.uni-trier.de/db/conf/ecai/ecai2020.html#SkibaNR20
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Complexity of nonemptiness in control argumentation frameworks ⋮ Acceptance in incomplete argumentation frameworks
This page was built for publication: Complexity of Possible and Necessary Existence Problems in Abstract Argumentation
