We gratefully acknowledge support from
the Simons Foundation and member institutions.
Full-text links:

Download:

Current browse context:

cs.AI
< prev | next >
new | recent | 2204

Change to browse by:

cs

References & Citations

DBLP - CS Bibliography

listing | bibtex

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo

Computer Science > Artificial Intelligence

Title: Reducing SAT to Max2XOR

Authors: Carlos Ansótegui, Jordi Levy
(Submitted on 4 Apr 2022)
Abstract: 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.
Subjects: Artificial Intelligence (cs.AI)
Cite as: arXiv:2204.01774 [cs.AI]
  (or arXiv:2204.01774v1 [cs.AI] for this version)

Submission history

From: Jordi Levy [view email]
[v1] Mon, 4 Apr 2022 18:06:24 GMT (238kb,D)
Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Link back to: arXiv, form interface, contact.