On using QUBO to enforce extensions in abstract argumentation

This paper summarizes our first discoveries in encoding Abstract Argumentation problems as Quadratic Unconstrained Binary Optimization problems. Classical and quantum annealers can then solve such formulations. In particular, we focus here on an optimization approach to extension enforcement, where a set of arguments is requested to satisfy a given semantics through possible changes of the considered Abstract Argumentation framework.