Reducing SAT to Max2XOR
This work addresses the challenge of applying efficient reasoning techniques to problems by representing them with XOR clauses, though it appears incremental as it builds on existing translation and resolution methods.
The paper tackles the problem of translating SAT clauses into Max2XOR constraints and introduces new resolution rules for the Max2XOR problem, which involves finding the maximum number of satisfiable constraints from a set of 2XOR equations.
Representing some problems with XOR clauses (parity constraints) can allow to apply more efficient reasoning techniques. In this paper, we present a gadget for translating SAT clauses into Max2XOR constraints, i.e., XOR clauses of at most 2 variables equal to zero or to one. Additionally, we present new resolution rules for the Max2XOR problem which asks for which is the maximum number of constraints that can be satisfied from a set of 2XOR equations.