Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem

摘要

The inverse satisfiability problem over a set of relations Γ (Inv-SAT(Γ)) is the problem of deciding whether a relation R can be defined as the set of models of a SAT(Γ) instance. Kavvadias and Sideri (1998) [15] obtained a dichotomy between P and co-NP-complete for finite Γ containing the two constant Boolean relations. However, for arbitrary constraint languages the complexity has been wide open, and in this article we finally prove a complete dichotomy theorem for finite languages. Kavvadias and Sideri's techniques are not applicable and we have to turn to the more recent algebraic approach based on partial polymorphisms. We also study the complexity of the inverse constraint satisfaction problem prove a general hardness result, which in particular resolves the complexity of inverse k-colouring, mentioned as an open problem in Chen (2008) [8].