DeepAI AI Chat
Log In Sign Up

On SAT representations of XOR constraints

by   Matthew Gwynne, et al.

We study the representation of systems S of linear equations over the two-element field (aka xor- or parity-constraints) via conjunctive normal forms F (boolean clause-sets). First we consider the problem of finding an "arc-consistent" representation ("AC"), meaning that unit-clause propagation will fix all forced assignments for all possible instantiations of the xor-variables. Our main negative result is that there is no polysize AC-representation in general. On the positive side we show that finding such an AC-representation is fixed-parameter tractable (fpt) in the number of equations. Then we turn to a stronger criterion of representation, namely propagation completeness ("PC") --- while AC only covers the variables of S, now all the variables in F (the variables in S plus auxiliary variables) are considered for PC. We show that the standard translation actually yields a PC representation for one equation, but fails so for two equations (in fact arbitrarily badly). We show that with a more intelligent translation we can also easily compute a translation to PC for two equations. We conjecture that computing a representation in PC is fpt in the number of equations.


page 1

page 2

page 3

page 4


Reducing SAT to Max2XOR

Representing some problems with XOR clauses (parity constraints) can all...

Almost Consistent Systems of Linear Equations

Checking whether a system of linear equations is consistent is a basic c...

Nearly all k-SAT functions are unate

We prove that 1-o(1) fraction of all k-SAT functions on n Boolean variab...

Propagation complete encodings of smooth DNNF theories

We investigate conjunctive normal form (CNF) encodings of a function rep...

Parameterized String Equations

We study systems of String Equations where block variables need to be as...

Unit contradiction versus unit propagation

Some aspects of the result of applying unit resolution on a CNF formula ...