From XSAT to SAT by Exhibiting Equivalencies

Given a Boolean formula in conjunctive normal form (CNF), the exact satisfiability problem (XSAT), a variant of the satisfiability problem (SAT), consists in finding an assignment to the variables such that each clause contains exactly one satisfied literal. Best algorithms to solve this problem runs in O(2^0.2325n) (O(2^0.1379n) for X3SAT) [12]. Another possibility is to transform each clause in a set of equivalent clauses for the Satisfiability problem and to use modern and powerful solvers (zChaff [14], Berkmin [6], MiniSat [5], RSat [16] etc.) to find such truth assignment. In this paper we introduce two new encoding from XSAT instances to SAT instances that leads to a lot of structural information (especially equivalencies) which is naturally hidden in the pairwise transformation. Some solvers (lsat[15], march dl [7], eqsatz [10]) can take into account this kinds of structural information to make simplifications as pretreatment and speed-up the resolution. Then we show the interest of dealing with the XSAT formalism by introducing an encoding of binary CSP and graph coloring problem into XSAT instances. Preliminary results on graph coloring problem show the importance of exhibiting equivalencies for the XSAT problem.