将SAT还原为Max2XOR

摘要：

用XOR子句（奇偶约束）表示一些问题可以允许应用更有效的推理技术。在本文中，我们提出了一个小工具，用于将SAT子句转换为Max2XOR约束，即，最多2个变量等于0或1的XOR子句。此外，我们提出了新的决议规则的Max2XOR问题，要求的最大数量的约束，可以满足从一组2XOR方程。

英文摘要：

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.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。