Computing Preferred Semantics: Comparing Two ASP Approaches vs an Approach Based on 0-1 Integer Programming

Dung’s abstract argumentation frameworks has been object of intense study not just for its relationship with logical reasoning but also for its uses within artificial intelligence. One research branch in abstract argumentation has focused on finding new methods for computing its different semantics. We present a novel method, to the best of our knowledge, for computing preferred semantics using 0-1 integer programming, and also experimentally compare it with two answer set programming approaches. Our results indicate that this new method performed well.