Dichotomy Theorem for the Generalized Unique Satisfiability Problem - Archive ouverte HAL Access content directly
Conference Papers Year : 1999

Dichotomy Theorem for the Generalized Unique Satisfiability Problem


The unique satisfiability problem, that asks whether there exists a unique solution to a given propositional formula, was extensively studied in the recent years. This paper presents a dichotomy theorem for the unique satisfiability problem, partitioning the instances of the problem between the polynomial-time solvable and coNP-hard cases. We notice that the additional knowledge of a model makes this problem coNP-complete. We compare the polynomial cases of unique satisfiability to the polynomial cases of the usual satisfiability problem and show that they are incomparable. This difference between the polynomial cases is partially due to the necessity to apply parsimonious reductions among the unique satisfiability problems to preserve the number of solutions. In particular, we notice that the unique not-all-equal satisfiability problem, where we ask whether there is a unique model such that each clause has at least one true literal and one false literal, is solvable in polynomial time.
Not file

Dates and versions

inria-00099003 , version 1 (26-09-2006)


  • HAL Id : inria-00099003 , version 1


Laurent Juban. Dichotomy Theorem for the Generalized Unique Satisfiability Problem. 12th International Symposium on Fundamentals of Computation Theory - FCT'99, 1999, Iasi, Romania, pp.327-337. ⟨inria-00099003⟩
83 View
0 Download


Gmail Facebook Twitter LinkedIn More