logic - Converting to XOR conjunctive form -

the xor conjunctive form defined follows : (a xor b) , (c xor d)...etc

and sat-xcf language defined precedent (xor conjunctive) expressions satisfiable.

i know sat-xcf np hard ? thus, there function able convert satisfiable boolean expression satisfiable xor conjunctive form ?

thank contribution.

i think answer last question "no" 2 variables. specifically, (a or b) cannot represented , of number of xor expressions. there few different xor expressions in 2 variables: false, true, a, b, !a, !b, (a xor b), , (a xor !b). if , of these: false, true, a, b, !a, !b, (a xor b), (a xor !b) you'll set false 1 of 4 possible combinations of (a, b). leaves expression true, different (a or b).