Minimal Strong Admissibility: A Complexity Analysis

Martin Caminada, Paul E. Dunne. Minimal Strong Admissibility: A Complexity Analysis. In Henry Prakken, Stefano Bistarelli, Francesco Santini 0001, Carlo Taticchi, editors, Computational Models of Argument - Proceedings of COMMA 2020, Perugia, Italy, September 4-11, 2020. Volume 326 of Frontiers in Artificial Intelligence and Applications, pages 135-146, IOS Press, 2020. [doi]

Abstract

Abstract is missing.