Dichotomy theorem for the generalized unique satisfiability problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1998

Dichotomy theorem for the generalized unique satisfiability problem

Laurent Juban
  • Function : Author
  • PersonId : 835318


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 polynomially solvable.
Fichier principal
Vignette du fichier
98-R-065.pdf (182.75 Ko) Télécharger le fichier

Dates and versions

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


  • HAL Id : inria-00098730 , version 1


Miki Hermann, Laurent Juban. Dichotomy theorem for the generalized unique satisfiability problem. [Intern report] 98-R-065 || hermann98b, 1998, 11 p. ⟨inria-00098730⟩
79 View
497 Download


Gmail Facebook Twitter LinkedIn More