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.
KeywordsPolynomial Time Dichotomy Theorem Logical Relation Conjunctive Normal Form Truth Assignment
Unable to display preview. Download preview PDF.
- [GJ79]M. R. Garey and D. S. Johnson. Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Co, 1979.Google Scholar
- [Koz92]D. C. Kozen. The design and analysis of algorithms, chapter 26: Counting problems and #P, pages 138–143. Springer-Verlag, 1992.Google Scholar
- [Pap94]C. H. Papadimitriou. Computational complexity. Addison-Wesley, 1994.Google Scholar
- [Sch78]T. J. Schaefer. The complexity of satisfiability problems. In Proceedings 10th Symposium on Theory of Computing (STOC’78), San Diego (California, USA), pages 216–226, 1978.Google Scholar