An encoding of argumentation problems using quadratic unconstrained binary optimization
<|reference_start|>An encoding of argumentation problems using quadratic unconstrained binary optimization: In this paper, we develop a way to encode several NP-Complete problems in Abstract Argumentation to Quadratic Unconstrained Binary Optimization (QUBO) problems. In this form, a solution for a QUBO problem involves minimizing a quadratic function over binary variables (0/1), where the coefficients can be represented by a symmetric square matrix (or an equivalent upper triangular version). With the QUBO formulation, exploiting new computing architectures, such as Quantum and Digital Annealers, is possible. A more conventional approach consists of developing approximate solvers, which, in this case, are used to tackle the intrinsic complexity. We performed tests to prove the correctness and applicability of classical problems in Argumentation and enforcement of argument sets. We compared our approach to two other approximate solvers in the literature during tests. In the final experimentation, we used a Simulated Annealing algorithm on a local machine. Also, we tested a Quantum Annealer from the D-Wave Ocean SDK and the Leap Quantum Cloud Service.<|reference_end|>
@article{baioletti2024an,
    title={An encoding of argumentation problems using quadratic unconstrained
  binary optimization},
    author={Marco Baioletti, Francesco Santini},
    journal={Quantum Mach. Intell. 6(2): 51 (2024)},
    year={2024},
    doi={10.1007/s42484-024-00186-9},
    archivePrefix={arXiv},
    eprint={2409.05524},
    primaryClass={quant-ph cs.AI}
}