Advanced SAT Techniques for Abstract Argumentation

Argumentation Johannes P. Wallner, Georg Weissenbacher, and Stefan Woltran Institute of Information Systems, Vienna University of Technology, Favoritenstraße 9-11, A-1040 Vienna, Austria Abstract. In the area of propositional satisfiability (SAT), tremendous progress has been made in the last decade. Today’s SAT technology covers not only the standard SAT problem, but also extensions thereof, such as computing a backbone (the literals which are true in all satisfying assignments) or minimal corrections sets (minimal subsets of clauses which if dropped leave an originally unsatisfiable formula satisfiable). In this work, we show how these methods can be applied to solve important problems from the area of abstract argumentation. In particular, we present new systems for semi-stable, ideal, and eager semantics. Our experimental results demonstrate the feasibility of this approach. In the area of propositional satisfiability (SAT), tremendous progress has been made in the last decade. Today’s SAT technology covers not only the standard SAT problem, but also extensions thereof, such as computing a backbone (the literals which are true in all satisfying assignments) or minimal corrections sets (minimal subsets of clauses which if dropped leave an originally unsatisfiable formula satisfiable). In this work, we show how these methods can be applied to solve important problems from the area of abstract argumentation. In particular, we present new systems for semi-stable, ideal, and eager semantics. Our experimental results demonstrate the feasibility of this approach.