A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
A Dichotomy Theorem for the Inverse Satisfiability Problem
2018
Foundations of Software Technology and Theoretical Computer Science
The inverse satisfiability problem over a set of Boolean relations Γ (Inv-SAT(Γ)) is the computational decision problem of, given a relation R, deciding whether there exists a SAT(Γ) instance with R as its set of models. This problem is co-NP-complete in general and a dichotomy theorem for finite Γ containing the constant Boolean relations was obtained by Kavvadias and Sideri. In this paper we remove the latter condition and prove that Inv-SAT(Γ) is always either tractable or co-NP-complete for
doi:10.4230/lipics.fsttcs.2017.39
dblp:conf/fsttcs/LagerkvistR17
fatcat:uzdeleecbzcttpqqhg3lwdvsey