The International Conference on Computational Models of Argument (COMMA) is one of the main forums for presentation and exchange of the latest research results related to computational aspects of argumentation. At this year's COMMA, held in Warsaw, Matthias Thimm and Tjitze Rienstra presented several recent works. Matthias Thimm gave presentations on Stochastic Local Search Algorithms for Abstract Argumentation under Stable Semantics, Probabilistic Graded Semantics and Epistemic Attack Semantics. Tjitze Rienstra presented work on Ranking Functions over Labellings.
Contact for inquiries: