What are known 3SAT to 2SAT reductions?
-
05-11-2019 - |
Question
Is there a way to convert a 3SAT formula into a equisatisfiable 2SAT formula? Each method is of interest, even those that grow exponentially. (So if, for example, my 3SAT formula has 16 variables and 32 clauses, a transformed 2SAT formula would have 2ˆ16 variables and / or 2ˆ32 clauses)
An example of a 3SAT formula I would like to convert is:
A xor B xor C
Or the same in CNF:
(A or B or C) and (A or !B or !C) and (!A or !B or C) and (!A or B or !C)
No correct solution
Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange