This paper presents a reduction from the problem of solving parity games to the satisfiability problem in propositional logic (SAT). The reduction is done in two stages, first into difference logic, i.e. SAT combined with the theory of integer differences, an instance of the SAT modulo theories (SMT) framework. In the second stage the integer variables and constraints of the difference logic encoding are replaced with a set of Boolean variables and constraints on them, giving rise to a pure SAT encoding of the problem. The reduction uses Jurdzińskis characterisation of winning strategies via progress measures. The reduction is motivated by the success of SAT solvers in symbolic verification, bounded model checking in particular. The paper reports on prototype implementations of the reductions and presents some experimental results. © 2011 Elsevier Inc. All Rights Reserved.
Heljanko, K., Keinänen, M., Lange, M., & Niemelä, I. (2012). Solving parity games by a reduction to SAT. Journal of Computer and System Sciences, 78(2), 430–440. https://doi.org/10.1016/j.jcss.2011.05.004