Accepted paper at COMMA 2018

25.6.2018
The work proposes and studies first SAT and MaxSAT approaches to three distinct hard computational problems over abstract argumentation frameworks.

Constraint Reasoning and Optimization group will present the paper SAT-based Approaches to Adjusting, Repairing, and Computing Largest Extensions of Argumentation Frameworks, authored by Tuomo Lehtonen, Andreas Niskanen, and Matti Järvisalo, at the 7th International Conference on Computational Aspects of Argumentation (COMMA 2018). The work proposes and studies first SAT and MaxSAT approaches to three distinct hard computational problems over abstract argumentation frameworks: the problem of finding a largest extension and two problems related to argumentation dynamics, namely optimal repair and adjustment of extensions given changes to an underlying argumentation framework.

Organized biannually, COMMA is the main international conference on computational aspect of argumentation. COMMA 2018 takes place September 11-14 in Warsaw, Poland.

More about the subject: Data Science