Finitary Argumentation: Complexity of Grounded and Preferred Semantics
A new arXiv paper analyzes the computational complexity of grounded and preferred semantics in finitary argumentation frameworks, where each argument interacts with finitely many others.