@inproceedings{NiskanenWJ:JELIA2016,
 author = {Andreas Niskanen and Johannes Peter Wallner and Matti J\"arvisalo},
 title = {Pakota: A System for Enforcement in Abstract Argumentation},
 booktitle = {Proceedings of the 15th European Conference on Logics in
          Artificial Intelligence (JELIA 2016)},
 editor = {Loizos Michael and Antonis C. Kakas},
 pages = {385--4000},
 publisher = {Springer},
 series = {Lecture Notes in Computer Science},
 volume = {10021},
 year = {2016},
}

Abstract:

In this paper we describe Pakota, a system implementation that allows for solving 
enforcement problems over argumentation frameworks. Via harnessing Boolean satisfiability 
(SAT) and maximum satisfiability (MaxSAT) solvers, Pakota implements algorithms for 
extension and status enforcement under various central AF semantics, covering a range of 
NP-complete---via direct MaxSAT encodings---and $\SigmaP{2}$-complete---via MaxSAT-based 
counterexample-guided abstraction refinement---enforcement problems. We overview the 
algorithmic approaches implemented in Pakota, and describe in detail the system 
architecture, features, interfaces, and usage of the system. Furthermore, we present an 
empirical evaluation on the impact of the choice of MaxSAT solvers on the scalability of 
the system, and also provide benchmark generators for extension and status enforcement.